Understanding Quick Sort
- One of the algorithms for sorting / sorting data.
- This algorithm was invented by C.A.R. Hoare in 1962.
- The principle of this algorithm is a divide and conquer.
- Quick sort starts by scanning the sorted array for the median value.
- This value, called the pivot, is then moved to one side of the array and elements whose value is greater than the pedestal is moved to the other side.