Choose the correct alternatives (More than one may be correct).
The complexity of comparision based sorting algorithms is:
Only A & C are possible in Comparision based sorting
@Arjun sir Isn't the question is asking what are the complexities possible in comparision based sorting
Just option A is Θ(nlogn) whereas for selection sort and bubble sort Θ(n2)
So we should consider both
UGC NET papers