Exercise $11$ referfo another algorithm, called bubble sort, which sorts an n$-$element list. Bubble sort makes multiple passes through the list from front to back, each time exchanging pairs of entries that are out of order. Here is a pseudocode version:

Get values for $n$ and the $n$ list items

Set the marker $U$ for the unsorted section at the end of the list

While the unsorted section has more than one element, do Steps $4$ through $8$

Set the current element marker $C$ at the second element of the list

While Chas not passed $U,$ do Steps $6$ and $7$

If the item at position $C$ is less than the item to its left, then exchange these two items

Move $C$ to the right one position

Move U left one position

Stop

For each of the following lists, perform a bubble sort, and show the list after each exchange. Compare the number of exchanges done here and in the Practice Problem at the end of Section $3\mathrm{.}3\mathrm{.}3.$

a$.4,8,2,6$

$4826$

type your answer..

type your answer..

type your answer...

type your answer... type your answer.. type your answer..

type your answer...

$2468$