Which of the following statements is false for the previous

Which of the following statements is false for the previous question if two keys are considered to be duplicates if they differ by less than epsilon (e.g., 0.00001)? Mark (d) if all are true.

(a) Quicksort can be used to solve the problem in expected O(N log(N)) time.

(b) Hashing can be used to solve the problem in expected O(N) time.

(c) Mergesort canbe used to solve the problem in O(N log(N)) time.

(d) All of the above are true.

Solution

(d) All of the above are true.

The statements

a) Quicksort can be used to solve the problem in expected O(N log(N)) time.

(b) Hashing can be used to solve the problem in expected O(N) time.

(c) Mergesort canbe used to solve the problem in O(N log(N)) time.

are all true.