Sorting

Consider the following array.

\begin{array}{|l|l|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?

Of the following sort algorithms, which has execution time that is least dependant on initial ordering of the input?

An array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places) is _________.

Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input?

Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be: