Sorting Algorithms - Study Mode
[#196] In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean?
Correct Answer
(C) Non-deterministic Polynomial time
[#197] The complexity of which of the following sorting algorithms remains to be the same in its best, average and worst case?
Correct Answer
(C) counting sort
[#198] In the following scenarios, when will you use selection sort?
Correct Answer
(C) Large values need to be sorted with small keys
[#199] What is the first step in the algorithm of stooge sort(after base case)?
Correct Answer
(D) compare first and last element of the array
[#200] The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
Correct Answer
(B) 2