Knowledge - 'QUIK SORT TECHNICS'

QUIK SORT TECHNICS

Quick sort is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays. A large array is partitioned into two arrays one of which holds values smaller than the specified value, say pivot, based on which t...See more

he partition is made and another array holds values greater than the pivot value. Quicksort partitions an array and then calls itself recursively twice to sort the two resulting subarrays. This algorithm is quite efficient for large-sized data sets as its average and worst-case complexity are O(nLogn) and image.png(n2), respectively. Partition in Quick Sort Following animated representation explains how to find the pivot value in an array.

Added: 3 years ago