Part II – Non-choice questions (非選擇題)

17. Consider processing a set of n items. The algorithm consists of two parts, first part takes O(n log n) time, second part takes Θ(n log n) time. What is the total time for processing the set of n items? Give me your reasons? Use the most precise asymptotic notation to present the time required. (2%)