campus placement AMCAT Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
If an array of size n has only 2 types of keys in it, let’s say 0 and 1 what is the worst case time required to sort such array?
1
logn
2
n
3
nlogn
4
n2