edited by
363 views
1 votes
1 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;
edited by

1 Answer

Best answer
2 votes
2 votes
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
Answer:

Related questions

2 votes
2 votes
2 answers
1
Bikram asked Oct 4, 2016
808 views
About how many compares will Quicksort() make when sorting an array of N items that are all equal?$\Theta(\lg N)$$\Theta(N\lg N)$$\Theta(\lg \lg N)$$\Theta(N/\lg N)$
2 votes
2 votes
4 answers
2
Bikram asked Oct 4, 2016
635 views
Is an array that is sorted in decreasing order a max-heap?always yesalways nosometimes onlyyes but not in presence of duplicates
26 votes
26 votes
3 answers
3
Kathleen asked Sep 25, 2014
7,851 views
Give the correct matching for the following pairs: $$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(P)} & \text{Selection} \\\hline \text{(B)} & \t...