Skip to content

Learning task. Constructing a maximal convex hull over a set of points, using two different sorts inside the Graham algorithm: quick sort, avl tree sort.

Notifications You must be signed in to change notification settings

lxvdnl/Greham-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 

About

Learning task. Constructing a maximal convex hull over a set of points, using two different sorts inside the Graham algorithm: quick sort, avl tree sort.

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published