問題詳情
【題組】(b) Merge Sort has worst-case time complexity O(n log n), while the worst-casetime complexity of Insertion Sort is O(n2. One weakness of Merge Sort isthat it requires additional space. Therefore, if space allows, we should alwaysuse Merge Sort for better efficiency.
參考答案