Option #1: Program 4 (Exercise #1) Data Structures

Implement the algorithm outlined in Exercise #1 (Chapter 8 of Carrano & Henry, 2015, p. 264) in Java. Provide for the sorting of an array in ascending and descending order. Explain the steps required to determine the Big-Oh notation for this algorithm.

Ensure that your program has the required class and a test class. Compile and submit Exercise 1, the Big-Oh evaluation, and screenshots of your program’s execution and output in a single document. Also attach all appropriate source code in a zip file.

Carrano, F. M., & Henry, T. (2015). Data structures and abstractions with Java (4th ed.). Upper Saddle River, NJ: Pearson.

EXERCISES
1. Show the contents of the array of integers 5 7 498 56 3 each time a selection sort changes it while sorting
the array into ascending order.
2. Repeat Exercise 1, but use an insertion sort instead.
3. Repeat Exercise 1, but use a Shell sort instead.