2 posts tagged with "Sorting"

Quick sort is a Divide & Conquer algorithm. At each step, it finds the Pivot and then makes sure that all the smaller elements are left of Pivot and all larger elements are on the right. It continues to do so recursively until the entire array is sorted

Merge sort is a Divide & Conquer algorithm. It divides the input array into 2 halves, and recursively breaks those halves until they become so small that it can't be broken further. Then, each section of the pieces are merged together to inch towards the final answer.