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- a; 2- c; 3 -b; 4- d; 1- c; 2- a; 3 -d; 4- b; 1- b; 2- d; 3 -a; 4- c; 1- d; 2- c; 3 -b; 4- a; Algorithms go-alogrithms-1 algorithms sorting time-complexity match-the-following easy + – Bikram asked Oct 4, 2016 • edited Jan 7 by Hira Thakur Bikram 364 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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. Arnab Bhadra answered Mar 22, 2017 • selected Mar 23, 2017 by Bikram Arnab Bhadra comment Share Follow See 1 comment See all 1 1 comment reply vishal jain 4 commented Jan 23, 2018 reply Follow Share sir,what is randomized quicksort??? 0 votes 0 votes Please log in or register to add a comment.