Why heap-sort is better than bubble sort?
Answers
Answered by
2
_______✨ HEY MATE ✨________
➡️ Because it is the slowest of the sorting algorithms but unlike merge and quick sort it does not require massive recursion or multiple arrays to work. Merge Sort: The merge sort is slightly faster than the heap sort for larger sets, but it requires twice the memory of the heap sort because of the second array.
✌️ I THINK IT HELPED YOU ✌️
➡️ Because it is the slowest of the sorting algorithms but unlike merge and quick sort it does not require massive recursion or multiple arrays to work. Merge Sort: The merge sort is slightly faster than the heap sort for larger sets, but it requires twice the memory of the heap sort because of the second array.
✌️ I THINK IT HELPED YOU ✌️
Similar questions