Given the fact that a selection sort of n items requires n²/2 + 5 * n/2 - 3 major operations,the selection sort is ______.
A)O(n)
B)O(1)
C)O(n²)
D)O(n²/2)

Question

Quizplus · Accepted Answer

The given expression for the number of major operations in selection sort is n²/2 + 5n/2 - 3. When we consider the worst-case scenario i.e., when the array is in reverse order, the number of comparisons and swaps will be maximum, and we can approximate the number of operations to (n^2)/2. Hence, the time complexity of selection sort is O(n²).

Given the Fact That a Selection Sort of N Items