Q9

Consider the following array.

$$\begin{array}{|l|l|l|l|l|l|} \hline 23&32&45&69&72&73&89&97 \\ \hline\end{array}$$

Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort the above array in ascending order?