申論題

10. (4 x 2 points) True or False Questions. If your answer is False, please briefly justify.(No point is given without justification if the answer is False)

(b) Merge Sort has worst-case time complexity O(n log n), while the worst-case time complexity of Insertion Sort is O(n². One weakness of Merge Sort is that it requires additional space. Therefore, if space allows, we should always use Merge Sort for better efficiency.