Bissoy.com
Doctors Medicines MCQs Q&A

The complexity of which of the following sorting algorithms remains to be the same in its best, average and worst case?

The complexity of which of the following sorting algorithms remains to be the same in its best, average and worst case? Correct Answer pigeonhole sort

The time complexity of pigeonhole remains unvaried in all three cases. It is given by O(n+k). But it is efficient only when the number of elements is comparable to the input range.

Related Questions

Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?
A candidate takes total of 6 exams in which he scored an average of 40 marks. If his best score and worst score are subtracted from these 6 exams, then in the remaining 4 tests his average score increased by 4.5. What is the average of his best score and worst score?
Questions below followed by three quantities. Find the relationship between them. Quantity I: In a class with a certain number of students if a teacher weighing 78 kg is added, then average weight of class is increased by 2 kg. If one more teacher weighing 66 kg is added, then the average weight of the class increases by 3.5 kg over the original average. What is the original average weight (in kg) of the class? Quantity II: The average age of 16 students and their teacher's age is 16 years. If the teacher's age is excluded, the average reduces by 2. What is the teacher's age? Quantity III: Average weight of three friends A, B and C is 46 kg. Another person D joins the group and now the average is 45 kg. If another person E whose weight is 6 kg more than D, joins the group replacing A, then average weight of B, C, D and E becomes 47 kg. What is the weight of A (in kg)?
The average of eight batsmen J, K, L, M, N, O, R, and T is compared. The number of batsman having average less than L are same as the number of batsman having average more than M. Average of T is less than M and more than K. Average of L is less than K. Average of two batsman lies between the average of M and L. Average of O is less than N and K both. Which of the following can be the correct sequence of their averages?
Consider the following sorting algorithms. I. Quicksort Il. Heapsort Ill. Mergesort Which of them perform in least time in the worst case?
Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
Which sorting algorithm takes same computational time in both best-case and worst-case scenario to sort an array?
Which of the following sorting algorithms is the fastest for sorting small arrays?
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting (? ≥ 2) numbers? In the recurrence equations given in the options below, ? is a constant.