gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

add details for "Heap Sort" (#21420)

Browse Source
This commit is contained in:
Prashant Chand
2018-11-12 21:24:52 +05:30
committed by Niraj Nandish
parent 8d8dff86f3
commit e1ae1bdd09
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
guide/english/algorithms/index.md
View File

@ -38,6 +38,10 @@ There is no sorting discussion which can finish without quick sort.
It is the sorting algorithm which relies on the concept how to sorted arrays are merged to give one sorted arrays. Read more about it here- It is the sorting algorithm which relies on the concept how to sorted arrays are merged to give one sorted arrays. Read more about it here-
[Merge Sort](https://www.geeksforgeeks.org/merge-sort/) [Merge Sort](https://www.geeksforgeeks.org/merge-sort/)
#### Heap Sort
A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree, so the heap sort algorithm must also reverse the order. Read more about it here-
[Heap Sort](https://www.geeksforgeeks.org/heap-sort/)
freeCodeCamp's curriculum heavily emphasizes creating algorithms. This is because learning algorithms is a good way to practice programming skills. Interviewers most commonly test candidates on algorithms during developer job interviews. freeCodeCamp's curriculum heavily emphasizes creating algorithms. This is because learning algorithms is a good way to practice programming skills. Interviewers most commonly test candidates on algorithms during developer job interviews.
### Further Resources ### Further Resources