大学生刷题搜题备考APP
下载APP
【单选题】
the complexity becomes 在其上进行查找的最坏时间复杂度为A.
O(1)
B.
O(lgn)
C.
O(n)
D.
O(nlgn)
参考答案：
参考解析：
刷刷题刷刷变学霸
举一反三
【单选题】Why does Zachary think he can't be a good teacher?
A.
He doesn't like children.
B.
He thinks he is impatient.
C.
He thinks he can never understand children.
【单选题】Where will Jessica and her friends visit during the weekend?
A.
The Temple of Heaven.
B.
The Tiananmen Square.
C.
The Olympic Park.
【单选题】We are ________ a survey to find out what our customers think of their local bus service.
A.
revealing
B.
identifying
C.
conducting
D.
indicating
【单选题】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
相关题目：
【单选题】Why does Zachary think he can't be a good teacher?
A.
He doesn't like children.
B.
He thinks he is impatient.
C.
He thinks he can never understand children.
【单选题】Where will Jessica and her friends visit during the weekend?
A.
The Temple of Heaven.
B.
The Tiananmen Square.
C.
The Olympic Park.
【单选题】We are ________ a survey to find out what our customers think of their local bus service.
A.
revealing
B.
identifying
C.
conducting
D.
indicating
【单选题】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
打开“刷刷题APP”, 刷题搜题更便捷
打开APP
