Question

complete the following in c++ programming code and answer question 3. use question 2 below as reference

2. If your nameArray variable is sorted using Bubble Sort Algorithm, it will go through a several pass-throughs and characters will be swapped in each pass-through, until nameArray gets completed sorted (alphabetically ascending order). Show all these stages (Passes and iterations within Passes) for your nameArray. Based on our example, here is a sample of how I want you to write these steps: Pass-1 [JOINPDOE==> [O N P D O E [J N] P D O E ==> 0 [NJ] P D O E Note: O and J were swapped Note: N and J were swapped ONJ P D OEONJ D P OE Note: D and P were swapped O N J D [P O] E ==> O N J D [O P] E Note: O and P were swapped O N J D O [PE] ==> O N J D O [EP] Note: E and P were swapped Pass-2: [O N] J DOPE==> [O NI J DOEP O [NJ] D O P E ==> 0 [J N] D O E P Note: No Swap Note: J and N were swapped ...(so on, until the array is completely sorted) How many passes were required? How many iterations within each pass? How many swaps were performed? HOW STEPS OF BUBBLE SORT APPLIED ON YOUR NAME ARRAY SHOWN IT ANSWER 3. Repeat the same process with nameArray and this time show the stages when Selection Sort Algorithm is used. How many iterations were required? N YOUR NAME 2. ANSWER THE QUESTION

Answer 1

Pass 1: Move smallest character in [0,6] to first place, which is D

JONPDOE ==> DJONPOE Note: D is moved to the first place

Pass 2: Move smallest character in [1,6] to second place, which is E

DJONPOE ==> DEJONPO Note: E is moved to the second place

Pass 3: Move smallest character in [2,6] to third place, which is J

DEJONPO ==> DEJONPO Note: J is already at the correct place

Pass 4: Move smallest character in [3,6] to fourth place, which is N

DEJONPO ==> DEJNOPO Note: N is moved to the fourth place

Pass 5: Move smallest character in [4,6] to fifth place, which is N

DEJNOPO ==> DEJNOPO Note: O is already at the correct place

Pass 6: Move smallest character in [5,6] to sixth place, which is O

DEJNOPO ==> DEJNOOP Note: last O is moved to 6th place

The algorith in O(n²) as there are two nested loops. At each iteration, smallest element is selected from remaining array.

Number of steps: 6