adplus-dvertising
frame-decoration

Question

Which of the below given sorting techniques has highest best-case runtime complexity

a.

quick sort

b.

selection sort

c.

insertion sort

d.

bubble sort

Answer: (b).selection sort

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the below given sorting techniques has highest best-case runtime complexity

Similar Questions

Discover Related MCQs

Q. How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4} ?

Q. An adaptive sorting algorithm −

Q. The following sorting algorithms maintain two sub-lists, one sorted and one to be sorted −

Q. The worst case complexity of binary search matches with −

Q. The number of comparisons done by sequential search is ………………

Q. In ……………, search start at the beginning of the list and check every element in the list.

Q. State True or False.

i) Binary search is used for searching in a sorted array.

ii) The time complexity of binary search is O(logn).

Q. Which of the following is not the internal sort?

Q. In general, the binary search method needs no more than ……………. comparisons.

Q. The Worst case occur in linear search algorithm when

Q. The Average case occur in linear search algorithm

Q. Which of the following is not the required condition for binary search algorithm?

Q. Which of the following is not a limitation of binary search algorithm?

Q. Binary search algorithm can not be applied to

Q. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

Q. You have to sort a list L consisting of a sorted list followed by a few “random” elements. Which of the following sorting methods would be especially suitable for such a task?

Q. A technique for direct search is

Q. The searching technique that takes O (1) time to find a data is

Q. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is

Q. In worst case Quick Sort has order