in Algorithms
145 views
2 votes
2 votes

Match the following two columns given in a table:

1. Randomized quick sort a. $\Theta(n+k)$
2. Insertion sort b. $\Theta\left(n^2\right)$
3. selection sort c. $\Theta(n)$
4. Bucket sort d. $\Theta(n\log n)$
  1. 1- a;  2- c;  3 -b;  4- d;
  2. 1- c;  2- a;  3 -d;  4- b;
  3. 1- b;  2- d;  3 -a;  4- c;
  4. 1- d;  2- c;  3 -b;  4- a;
in Algorithms
by
145 views

1 Answer

2 votes
2 votes
Best answer
Correct answer is D.

Column A is the list of Sorting Algorithms and Column B is the best case time complexity of these algorithms.

Option D is the correct match.
selected by

1 comment

sir,what is randomized quicksort???
0
0
Answer:

Related questions