Heapsort

[dimitrijjedich]

🚀 Not just another binary tree

🗒️ General

The heapsort is some sort of binary tree where the root is either the smallest or the largest value on the heap. With this implementation I also removed the use of the structure that defines a binary tree. Instead of nodes and a root the heap will be implemented by using an array that can be intterated by this rules:

arr[(i -1) / 2]; // parent of i node
arr[(2 * i) + 1]; //left child of i node.
arr[(2 * i) + 2]; //right child of i node.

---

📐🏗️📝 Operations

The heap is handeled like a basic binary tree and therefor has similar operations:

🌳👀 Peek

Is the simple operation which retrives the root or the first element of the heap array

🌳⬅️ Insertion

Provided a value, appending it to the end of the heap array and comparing and swapping it with its parent aslong as the first element is not reached or the parent is in the corect order with the new value.

[sonarqubecloud]

Quality Gate failed

Failed conditions
0.0% Coverage on New Code (required ≥ 80%)

See analysis details on SonarQube Cloud