Given the following array :

$\underset{0}{\boxed{13}}\underset{1}{\boxed{19}}\underset{2}{\boxed{6}}\underset{3}{\boxed{2}}\underset{4}{\boxed{35}}\underset{5}{\boxed{28}}\underset{6}{\boxed{51}}\underset{7}{\boxed{16}}\underset{8}{\boxed{65}}\underset{9}{\boxed{4}}$

Which sorting algorithm would produce the following result after three iterations.

$\underset{0}{\boxed{13}}\underset{1}{\boxed{6}}\underset{2}{\boxed{2}}\underset{3}{\boxed{19}}\underset{4}{\boxed{35}}\underset{5}{\boxed{28}}\underset{6}{\boxed{51}}\underset{7}{\boxed{16}}\underset{8}{\boxed{65}}\underset{9}{\boxed{4}}$

Bubble sort algorithm

Reason — In bubble sort, the adjoining values are compared and exchanged if they are not in proper order. This process is repeated until the entire array is sorted.

In the first pass, (13,19) will be compared but not swapped. The array after the first pass will be:

$\underset{0}{\boxed{13}}\underset{1}{\boxed{19}}\underset{2}{\boxed{6}}\underset{3}{\boxed{2}}\underset{4}{\boxed{35}}\underset{5}{\boxed{28}}\underset{6}{\boxed{51}}\underset{7}{\boxed{16}}\underset{8}{\boxed{65}}\underset{9}{\boxed{4}}$

In the second pass, (19, 6) will be compared and swapped. The array after the second pass will be:

$\underset{0}{\boxed{13}}\underset{1}{\boxed{6}}\underset{2}{\boxed{19}}\underset{3}{\boxed{2}}\underset{4}{\boxed{35}}\underset{5}{\boxed{28}}\underset{6}{\boxed{51}}\underset{7}{\boxed{16}}\underset{8}{\boxed{65}}\underset{9}{\boxed{4}}$

In the third pass, (19, 2) will be compared and swapped. The array after the third pass will be:

$\underset{0}{\boxed{13}}\underset{1}{\boxed{6}}\underset{2}{\boxed{2}}\underset{3}{\boxed{19}}\underset{4}{\boxed{35}}\underset{5}{\boxed{28}}\underset{6}{\boxed{51}}\underset{7}{\boxed{16}}\underset{8}{\boxed{65}}\underset{9}{\boxed{4}}$