Ideally, x (pivot) should have a rank that is neither too large nor too small?
a) True
b) False
c) N/A
d) NA
In particular "large enough" means that the number of items is at least some fixed constant fraction of n (e.g. n/2, n/3)?
a) True
b) False
c) NA
d) NA
The sieve technique is a special case, where the number of sub problems is….
a) 3
b) 1
c) just 1
d) 0
We think of divide-and-conquer as breaking the problem into a small number of bigger sub-problems, which are then solved recursively?
a) True
b) False
c) NA
d) N/A
A very important special case of divide-and-conquer, which I call the sieve technique?
a) True
b) False
c) NA
d) N/A
In particular, is it possible to solve the selections problem in O(n) time?
a) No
b) yes
c) yes. However, the solution is far from obvious
d) NA
