For this assignment, you’ll be creating a Bubble Sort algorithm. This algorithm is capable of taking a list of numbers and placing them in order, however it is also known as one of the least efficient means of doing so.
For your assignment, you’ll need to not only sort the given input (and display it in its final sorted form) but you’ll also need to keep track of how many comparisons and reassignments happen.
So, comparing two numbers will be counted as a SINGLE action. Swapping the location of two variables will meanwhile be considered THREE actions – one to store a variable to be swapped in a temporary storage location, another to swap the first of the variables to the second location, and a third to move the variable from the temporary storage location back to where it’s going to go.
To summarize, comparing two objects in the array will count as ONE action, and swapping two objects in the array will count as THREE actions.
Your results should not only display the sorted version of the array but also a count of the total number of actions that took place while sorting. Please sort the following three lists:
An example output might look like:
Sorted List: (1,2,3,4,5,6,7,8,9,10)
124 Actions Performed.
(100 pts total: 40 points for code, 20 points for each sorted list plus action count)