下载APP
【单选题】
How does Zachary's friend talk with his friends?
A.
He chats with them online every day.
B.
He goes out and meets them.
C.
He seldom talks with his friends.
举报
参考答案：
参考解析：
刷刷题刷刷变学霸
举一反三
【单选题】For vectors of size n, the optimal and worst-case time complexity for merge sorting is: 对于规模为n的向量，归并排序的最优、最坏时间复杂度分别为：
A.
$\Theta(n),\Theta(nlog_2n)$
B.
$\Theta(nlog_2n),\Theta(nlog_2n)$
C.
$\Theta(nlog_2n),\Theta(n^2)$
D.
$\Theta(n),\Theta(n^2)$
【单选题】What is the time complexity for searching in an AVL tree with n nodes?在包含n个节点的AVL树中进行查找的时间复杂度为
A.
O(1)
B.
O(lgn)
C.
O(n)
D.
O(nlgn)
【单选题】Drugs can slow down the ________ of the disease.
A.
foundation
B.
program
C.
profile
D.
progression
【判断题】提康德罗加级巡洋舰共27艘，首舰开始服役于1983年，目前该级舰有些已经退役。除了托马斯·盖兹号外，全部的舰名都是以美国历史上著名的古战场为名，且其中有12艘继承了第二次世界大战的航母舰名。
A.
正确
B.
错误
【单选题】It's not a pure substance, () it is made of different substances.
A.
lthough
B.
ecause