

InterviewSolution
Saved Bookmarks
1. |
The complexity of merge sort algorithm is _________(a) O(n)(b) O(log n)(c) O(n^2)(d) O(n log n)I have been asked this question in an internship interview.I need to ask this question from Algorithms in chapter Algorithms of Discrete Mathematics |
Answer» The correct option is (d) O(N log n) |
|