Quick Sort algorithm

Question

Give brief description of the term Quick Sort algorithm?

Answer 1

The quick sort an algorithm is of conquers and divides type. That means it works by decreasing a sorting problem in several easier sorting problems and solving each of them. A dividing value is selected from the input data, and the data is partitioned in three sets: elements which belong before the dividing value, the value itself, and elements which come after the dividing value. The partitioning is performed by a exchanging elements which are in the first set but belong in the third with elements that are in the third set however belong in the first Elements that are equivalent to the dividing element can be put in any of the three sets the algorithm will still work properly.