多选题

知识点：数据结构 8/10（多选/必答） Which of the fol...

Question

知识点：数据结构 8/10（多选/必答）
Which of the following(s) are true when sorting N elements?

A. Non-randomized Quicksort has a worst-case time complexity of O(N^2).

B. Insertion sort has best-case time complexity of O(N).

C. Insertion sort has expected time complexity of O(N*logN).

D. Heap sort has expected time complexity of O(N*logN).