☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch7 搜尋與排序
第 73 題／共 76 題
◀
DS 73/76
錯題回報
00:00
73. Sorting Algorithms
#DS-07-073
易
Sorting Algorithms
📝
☆
Choose the correct statement(s):
A
The insertion sort algorithm has the worst-case time complexity
O
(
n
2
)
O(n^2)
O
(
n
2
)
, the average-case time complexity
O
(
n
2
)
O(n^2)
O
(
n
2
)
, and the best-case time complexity
O
(
n
)
O(n)
O
(
n
)
.
B
The merge sort algorithm has the worst-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, the average-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, the best-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, and the space complexity
O
(
n
)
O(n)
O
(
n
)
.
C
The quick sort algorithm has the worst-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, the average-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, and the best-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
.
D
The heap sort algorithm has the worst-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, the average-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, the best-case time complexity
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
, and the space complexity
O
(
n
)
O(n)
O
(
n
)
.
E
The bubble sort algorithm has the worst-case time complexity
O
(
n
2
)
O(n^2)
O
(
n
2
)
, the average-case time complexity
O
(
n
2
)
O(n^2)
O
(
n
2
)
, and the space complexity
O
(
1
)
O(1)
O
(
1
)
.
📝 寫筆記
📄 中央111
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch7 搜尋與排序
‹
本章題號 · 61–76 / 76
›
全部 76
易 63
中 13
難 0
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
