Verified
The quick sort algorithm is of the divide and conquers type. It means this works by reducing a sorting problem in several easier sorting problems and then solving each of them. A dividing value is selected from the input data, and from the data is partitioned in three sets: components that belong before the dividing value, and the value itself, and elements which come after the dividing value. The partitioning is represented by exchanging elements which are in the first set but belong in the third along with elements which are in the third set but belong in the first Elements which are equal to the dividing element can be put into any of the three sets the algorithm will even work properly.