Quick Sort
Quick Sort is a very popular divide and conquer algorithm used for sorting collections. Quick sort works by selecting a pivot element and partition the array such that all the elements to the left of pivot are smaller that the pivot element.