Typical heapsort with the array organized as a ternary tree
I'm still impressed by how compact heapsort is. I had this one use 0 as the first element, even though starting with 1 is easier.
-
Notifications
You must be signed in to change notification settings - Fork 0
CaseyG5/ternary-heapsort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Typical heap sort with the array organized as a ternary tree
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published