PA of Algorithms Q83
0. Which of the following sorting algorithms has the lowest worst-case complexity?
- Option : A
- Explanation : Merge sort has lowest worst – case complexity, i.e. O(n log n), whereas all remaining three has O(n2)
You must be logged in to post a comment.
You must be logged in to post a comment.