23. Which of the following algorithms can sort n data in O(n log n) worst-case time?(A) bubble sort(
問題詳情
23. Which of the following algorithms can sort n data in O(n log n) worst-case time? (A) bubble sort (B) quick sort (C) merge sort (D) both quick sort and merge sort (E) both heap sort and bubble sort.