this program will sort array in descending order in nlog4n times it creates heap with each root node has at least 4 children. Given a left complete quaternary tree i.e. a parent node can have at max four children. this program will sort array in descending order #heapsort #minheapsort #decendingsorting #Burnaviour
-
Notifications
You must be signed in to change notification settings - Fork 0
this program will sort array in descending order in nlog4n times it creates heap with each root node has at least 4 children. Given a left complete quaternary tree i.e. a parent node can have at max four children. this program will sort array in descending order
License
Burnaviour/Heap-sort-with-4-children
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
this program will sort array in descending order in nlog4n times it creates heap with each root node has at least 4 children. Given a left complete quaternary tree i.e. a parent node can have at max four children. this program will sort array in descending order
Topics
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published