Pure Programmer

## Project: Quicksort

The [[Quicksort]] one of the most efficient sorts. It was first introduced by [[Tony Hoare]] in 1959. It can be implemented very easily using recursion. Write a function that takes a list of integers and sorts the list, in place, using a Quicksort. Test the function by creating a random list of integers, print the random list, sort the list, then print out the sorted list. Accept the number of integers to put in the list and the maximum integer to randomly generate on the command line. What is the worst case performance of the Quicksort?

Output
\$ g++ -std=c++17 Quicksort.cpp -o Quicksort -lfmt \$ ./Quicksort 10 10 Random List [6, 6, 8, 3, 9, 6, 2, 8, 1, 4] Sorted List [1, 2, 3, 4, 6, 6, 6, 8, 8, 9] \$ g++ -std=c++17 Quicksort.cpp -o Quicksort -lfmt \$ ./Quicksort 20 100 Random List [63, 76, 62, 76, 44, 83, 29, 51, 82, 37, 44, 51, 97, 38, 2, 21, 60, 74, 9, 35] Sorted List [2, 9, 21, 29, 35, 37, 38, 44, 44, 51, 51, 60, 62, 63, 74, 76, 76, 82, 83, 97]

Solution