Data Structures :: Complexity - Discussion
Home > Data Structures > Complexity > MCQs Questions Discussion
3 / 48
Choose the correct option.
If the array is already sorted, then the running time for merge sort is: ?
AO(1)
BO(n*log n)
CO(n)
DO(n^2)
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!