Sorting

HeapSort is an efficient (O(N*lognN) time) comparison-based sorting algorithm based on Binary Heaps. It works by dividing input unsorted array into the sorted and...

Bubble Sort is the simplest sorting algorithm that works by repeatedly comparing the adjacent elements and swapping them if they are in the wrong...

MergeSort is a Divide and Conquer based algorithm just like QuickSort, with best and worst-case sorting time complexity nlogn. MergeSort works by repeatedly diving...

Quicksort is a Divide and conquer based algorithm that picks a pivot element from the given array and partition(rearranges) the array in such a...

Selection sort is an in-place sorting algorithm that works on the notion of finding the minimum element(if sorting in ascending order) or maximum element(if...