McqMate
| Q. |
The complexity of merge sort algorithm is |
| A. | O(n) |
| B. | O(log n) |
| C. | O(n log n) |
| D. | None of these |
| Answer» C. O(n log n) | |
View all MCQs in
Data Structure and Algorithms (DSA)No comments yet