題組內容
5. Answer the following questions with either true or false. No explanation necessary.
(c) MergeSort has best-case time complexity of O(n). (4%)
5. Answer the following questions with either true or false. No explanation necessary.
(c) MergeSort has best-case time complexity of O(n). (4%)