Use the random number generator in class Random to store a list of 1000 pseudorandom integer values in an array. Apply each of the sort functions described in this chapter to the array and determine the number of comparisons and exchanges. Make sure the same array is passed to each sort function.

You will need to implement the following sorting functions:

"selection_sort",
"bubble_sort",
"insertion_sort",
"shell_sort",
"merge_sort",
"heap_sort",
"quick_sort"

Please see below for an example how to implement selection sort and the driver class to test the sorting functions.

Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.