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
burnaviour / heap-sort-with-4-children Goto Github PK
View Code? Open in Web Editor NEWthis 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: MIT License