EasyRearrange an array in order – smallest, largest, 2nd smallest, 2nd largestProblem Statement Suppose you have an integer array. The problem “Rearrange an array in order read more
Wiggle SortWiggle Sort!? All my readers must’ve found the name of today’s problem very funny. read more
Merge SortWhat is merge sort? Merge Sort is a Recursive Procedure. It is also a divide and conquers read more
Topological SortingGiven a directed acyclic graph, topologically sort the graph nodes. Topological Sorting Example read more
Insertion SortSort a given unsorted array using the insertion sort algorithm. Input: {9,5,1,6,11,8,4} Output: read more
Quick SortQuick Sort is a sorting algorithm. Given an unsorted array sort it using quick sort algorithm. read more
Heap SortHeap sort is a comparison based sorting technique that is based on a Binary Heap data structure. read more