Tejaswini

Quick Sort

Quick sort is a highly efficient sorting algorithm based on dividing an array of data into smaller arrays. A large array is divided into two arrays one of which holds values smaller than the specified value, say pivot, based on which the division is made and another array holds values greater than the pivot value. Quicksort divisions an array and then calls itself recursively twice to sort the two resulting subarrays. Divide and Conquer approach is followed in the Quick Sort Algorithm.