Heap Sort – Searching and Sorting – Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort.where we first find the maximum element and place the maximum element at the end.
heap
2 Articles
2
Interpolation Search – searching and sorting algorithm- The Interpolation Search is an improvement over Binary Search for instances, where the values .