we discussed a variety of sorting algorithms: bubble sort, selection sort, insertion sort, merge sort, and quick sort. We also implemented bubble sort together in class as an example, which you may use for reference on this assignment.

For your final programming assignment, choose a sorting algorithm (other than bubble sort) and implement it yourself. Then write a test program and show that it works.

Your test program should perform the following steps:

Create an array of random numbers.

Display the array in its original order.

Pass the array to your sorting function.

Display the array again to show that it has been sorted.