https://github.com/burnaviour/heap-sort-with-4-children
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
https://github.com/burnaviour/heap-sort-with-4-children
binary-search-tree binary-search-tree-4-childern heapsort heapsort-algorithm heapsort-optimized sort
Last synced: 3 months ago
JSON representation
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
- Host: GitHub
- URL: https://github.com/burnaviour/heap-sort-with-4-children
- Owner: Burnaviour
- License: mit
- Created: 2022-01-16T05:43:24.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-01-20T03:59:21.000Z (over 3 years ago)
- Last Synced: 2023-04-06T10:31:48.388Z (about 2 years ago)
- Topics: binary-search-tree, binary-search-tree-4-childern, heapsort, heapsort-algorithm, heapsort-optimized, sort
- Language: Python
- Homepage:
- Size: 3.91 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0