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.
quick sort algorithm
12 Articles
12
Merge Sort – searching and sorting algorithm – Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves.