Need Comments. And please if possible the picture of a running code.

We have talked about two sorting algorithms, Bubble Sort and Selection Sort. This one is slightly different and involves several concepts we have discussed. Here is the method:

1. You can use a statically-allocated one-dimensional array of doubles for this with length 100. You will never have more than 100 things to sort, but you may have fewer. Your program will have to keep track of how many elements you actually use.

2. Ask the user for the name of a file containing data. If it does not exist, the program should display an error, then ask for a new file name. Entering an asterisk (*) as the first and only character on a line should terminate the program.

3. The way linear insertion works is this:

A. If the list is empty, the number goes in the first array element.

B. If the list is not empty, search to find the two elements where the top one is smaller than the one you have and the bottom one is larger (assuming an ascending-order sort.) This is your insertion point. Then move everything below and including the insertion point down in the array. Put the new element in.

C. Increment the count of elements in the array

4. Once the list is sorted, print it.

5. Go back to step 2 and ask for another file name.

For example, if the file contains 6, 3, 7, and 2 your array would look like this at each step:

Step 1: Array is empty, so insert the 6.	6
Step 2: Move the 6 down, insert the 3	3 6
Step 3: Put the 7 at the end; nothing moves	3 6 7
Step 4: Move the 3, 6, and 7 down, then insert the 2.	2 3 6 7

Yes, this is terribly inefficient because of moving elements around, but it illustrates several important concepts, including sorting, functions with parameters and return values, file I/O, and array handling.

Data for checking the Code.

101 93.4 -9999.1 0 43 11 451 98.6 3.14 -40 0.01 256 -273 2.71 73 42 1024 9999999 216 -11.1 90.1 777.7 64 2048