Question

question 14
true or false: a notable advantage of mergesort over some other sorting algorithms is its high speed in the worst case.
false
true

Explanation:

Merge sort has a time complexity of $O(n\log n)$ in all cases (best, average, worst). Some sorting algorithms (like quick - sort) have worse time complexity ($O(n^{2})$) in the worst case. So merge sort's advantage over some others in worst - case speed is valid.

Answer:

True