Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?

A O(log n)
B O(n)
C O(n log n)
D O(n2)

Answer & Explanation

Answer: Option [B]

In selection sort, we identify the smallest value from the unsorted array and swap it with the value in the unsorted array at the starting point. In case of tightest upper bound maximum time needed and in case of lower bound minimum time needed to sort an unsorted array.

The number of iterations needed to sort an unsorted array in selection sort is equal to the numbers in that array.

i.e. in Big O-notation if n numbers in a unsorted array then n O(1) iterations needed to sort this array.

Your Valuable Comments Please...

Useful Computer Science EBooks