This problem will explore some basic traits of an unsorted list of data. We will not go to the extent of sorting the data, but try to understand some ideas leading to sorting. Write a class, UnsortedData, that has two "public static" methods:

Write a class, UnsortedData, that has two "public static" methods:

• A method called countOutOfPosition that

  • accepts as parameter an array of doubles, and

  • returns a count of how far "out of position" all the items are. Do this by summing up (for each item "i" in the array) how many items after item "i" in the unsorted list are smaller than item "i".

• A method called bubble that

  • takes as parameter and array of doubles, and

  • performs the following operation once on every item in the unsorted list: If an item is larger than the item after it, swap the items.

Write a UnsortedDataApp program, that

• prompts the user for a name of an input file

• reads 100 real numbers from that file. You can assume the file exists, and contains 100 valid real numbers.

• Then:

  • call "countOutOfPosition method and display the result.

  • call "bubble" and your first function again and see if there items are not as far "out of position" as before.

Make sure you add try-catch sections that handle FileNotFoundException where appropriate.

Here is a sample run:

Sample run:

What is the name of the input file? dataRandom.txt

Total Out of Order BEFORE Bubble = 2604

Total Out of Order AFTER Bubble = 2508