Introduction - If you have any usage issues, please Google them yourself
Quick Sort (Quicksort) is an improvement on the bubble sort. By C. A. R. Hoare in 1962. The basic idea is: sorted by a trip to sort the data is divided into two independent parts, part all the data than the other part of all data to be small, then this way the two parts were fast data Sort the entire sorting process can be recursively in order to achieve the data into an ordered sequence.