Describe the word Quick Sort

Describe in brief the word Quick Sort?

E

Expert

Verified

The quick sort algorithm is of the divide and conquers type. That signifies it works by reducing a sorting problem to some easier sorting problems and resolving each of them. A dividing value is selected from the input data and the data is partitioned to three sets: elements which belong before the dividing value, the value itself, and elements which come after the dividing value. The partitioning is executed by exchanging elements which are in the first set however belong in the third with elements which are in the third set however belong in the first Elements which are equivalent to the dividing element and can be put in any of the three sets the algorithm will still work correctly.

   Related Questions in Data Structure & Algorithms

©TutorsGlobe All rights reserved 2022-2023.