Performance Difference between Exchange Sort and Quick Sort

            Exchange sort is easy to understand and easy to implement but it's the most time consuming algorithm. Besides quick sort is the fastest algorithm out there. It's slightly difficult to understand but it's  the best one.

The Algorithm

These two algorithms are implemented in Turbo C/C++.

CPU: Intel CELERON 500.

Results are in seconds.

Test array is chosen to be reverse sorted.

Array size is 100

If the repetition is 1,6 Million, difference will be 140 – 45  = 95 seconds.

Performance percentage is 66.6 %.

In other words Quick Sort is 3 times faster than Exchange Sort.