Data Structures :: Searching & Sorting - Discussion
Home > Data Structures > Searching & Sorting > MCQs Questions Discussion
40 / 69
Choose the correct option.
The time complexity of insertion sort in worst case is?
An(n-1)/4
Bn(n+1)/4
Cn(n-1)/2
Dn(n+1)/2
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!