PLEASE DO THIS IN PYTHON, THERE ARE JAVA VERSIONS OUT THERE YOU CAN LOOK AT, AND PLEASE HAVE LOTS OF COMMENTS! THANK YOU!

Quicksort Versions

Here are the three versions of quicksort to use.

Basic Quicksort.

Random Pivot Point. The partition algorithm randomly pick an index value of the the array it is looking at. The array element at the location is the partition value.

Median-of-three Partitioning.

In this program we will look at three variations of quicksort. We will compare them on ten randomly generated lists of 1000 items. In addition, we will look at the algorithms performance on both a sorted and reverse sorted (sorted highest to lowest) version of each list.

We will look at the behavior of three different versions of quicksort on randomly generated lists of size 1000.

The three versions of quicksort are described below.

Randomly generate integers in the range 0-99 for your random numbers. You may choose your own random number generation technique. You must document the source of your random number generation in the code.

Here is what your code should do:

Do this 10 times:

Generate a random list of 1000 items.

Make a sorted version of the list.

Use whatever sort you want to do this. You do not need to demonstrate, annotate, etc. this sort.

Make a reverse-sorted (i.e. high to low) version of the list.

Modify whatever sort you want to do this. You do not need to demonstrate, annotate, etc. this sort.

Have each version of quicksort sort each of the three lists.

Give the original list, the sorted list, and the number of comparisons done by each version of the algorithm.

At the end:

For each quicksort version and each list type (random, pre-sorted, reverse-sorted) give the average of the number of comparisons.