Abstract— In this paper a comprehensive survey and empirical
study of the Quick sort algorithm is provided. The survey examines
in detail all the different variations of Quick sort starting with the
original version developed by Hoare in 1961 and ending with
some of the most recent ones. The paper also investigates some new
sorting algorithms and compares their performances to the various
versions of Quick sort. The study compared each algorithm in terms
of the number of comparisons performed and the running times
when used for sorting arrays of integers that were already sorted,
sorted in reverse order, and generated randomly.
Keywords—Empirical, Quick sort, Sorting, Survey