GATE 2022 : Algorithm Quiz -3

……… is rearranging pairs of elements which are out of order, until no such pairs remain.

The average successful search time for sequential search ‘n’ items is

______ sorting algorithms has the lowest worst-case time complexity.

The sorting algorithm which requires least number of swaps in the worst case is

Consider the following scenario during insertion sort when the array looks like the following:
{25, 75, 95, 125, 80, 5, 10}

The number of comparisons that it will further take for the array to be completely sorted are ________.