(A) different
(B) same
(C) NA
(D) NA
Tag: Fundamentals of Computer Algorithms
If n is not very large, then almost any algorithm __ be fast.
(A) may
(B) may be not
(C) will
(D) none
For n = 1, 000, 000, if plane-sweep takes 1 second, the bruteforce will take about __.
(A) 14 hours
(B) 14 minutes
(C) 14 second
(D) none
The runtime of entire plane-sweep algorithm is O(n log n)__.
(A) True
(B) False
(C) NA
(D) NA
Plane-sweep Algorithm, the inner while-loop __ execute more than n times over the entire course of the algorithm.
(A) can
(B) cannot
(C) NA
(D) NA
Sorting takes __ time.
(A) O(n)
(B) O(n^2)
(C) O(n log n)
(D) none
This approach of solving geometric problems by sweeping a line across the plane is called __.
(A) plane sweep
(B) brute force
(C) NA
(D) NA
This follows from the fact that dominance relation is __.
(A) symmetric
(B) transitive
(C) non-transitive
(D) none