![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Best and the worst case timing complexities of insertion sort are_________. |
A. | o(n2), o(n2) |
B. | o(n log n), o(n2) |
C. | o(n), o(n2) |
D. | o(n), o(n3) |
Answer» C. o(n), o(n2) |
View all MCQs in
Data Structure and Algorithms (DSA)No comments yet