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
sort binary-search-tree heapsort heapsort-algorithm heapsort-optimized binary-search-tree-4-childern
-
Updated
Jan 20, 2022 - Python