PA of Algorithms Q83

0. Which of the following sorting algorithms has the lowest worst-case complexity?

Answer
Comment
Array

Option : A
Explanation :
Merge sort has lowest worst – case complexity, i.e. O(n log n), whereas all remaining three has O(n²)

Forgot your password?

I agree with the Terms.