Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit a6205b1

Browse files
heap sorting
1 parent 3ce8880 commit a6205b1

File tree

1 file changed

+8
-0
lines changed

1 file changed

+8
-0
lines changed

‎Sorting Algorithms/Heap Sort/README.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
# HEAP SORT
2+
3+
- For Heap sort, we first convert our list to tree. So we are building heap.
4+
- Then we turn the built heap into max heap.
5+
- Max heap de parent node is always greater than or equal to child node.
6+
- Swap first and last node and delete last node.
7+
8+
<img src="https://he-s3.s3.amazonaws.com/media/uploads/e9d6f12.png" />

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /