@sivarajans/heap-sort-asc
v1.0.2
Published
Heap sort ascending
Downloads
12
Readme
Heap Sort - Ascending Order
Min Heap Invarient data structure is used.
- Do min heap invarient structure.
- Swap last element with root
- Pop last element (which is root) that has minimum value.
Zero Based Index Formula:
All the parent = floor(n / 2) - 1 -- here n is total elements.
Child-1 of parent = 2i + 1 -- here i is index (0 based)
Child-2 of parent = 2i + 2
npm i @sivarajans/heap-sort-asc