Question
Algorithms Question on Sorting
The average case complexity of Selection sort, Quick sort and Radix sort is respectively
A
O(n2), O(n2), O(n og2n)
B
O(n2), O(n log2n), O(n log2n)
C
O(n log2n), O(n2) 0(n2)
D
O(n log2n), O(n log2n), O(n log2n)
Answer
O(n2), O(n log2n), O(n log2n)
Explanation
Solution
The correct option is(B): O(n2), O(n log2n), O(n log2n)