Q381
Open questionWhat is the average time complexity of pigeonhole sort (k=range of input)?
Select an option to see the answer and solution.
Data Structure · all questionsSorting Algorithms
Sorting Algorithms
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
509
Questions
20/26
Page
Pick an option on a question to see the right answer and solution.
Q382
Open questionWhat will be the output of the given C++ code?
#include <bits/stdc++.h>
using namespace std;
int main()
{
int arr[] = {1,3,4,2,5};
int n = sizeof(arr)/sizeof(arr[0]);
sort(arr, arr+n, greater<int>());
int a;
for (a = 0; a < n; a++)
cout << arr[a] << " ";
return 0;
}Select an option to see the answer and solution.
Q383
Open questionBogosort works by . . . . . . . .
Select an option to see the answer and solution.
Q384
Open questionWhat is the average case time complexity of library sort?
Select an option to see the answer and solution.
Q385
Open questionWhat is the best case efficiency of bubble sort in the improvised version?
Select an option to see the answer and solution.
Q386
Open questionWhat is an internal sorting algorithm?
Select an option to see the answer and solution.
Q387
Open questionConsider the original array 17 8 12 4 26. How many comparisons are needed to construct the BST on the original array?
Select an option to see the answer and solution.
Q388
Open questionWhich of the following statements is the basic for loop for a shell sort algorithm?
Select an option to see the answer and solution.
Q389
Open questionBinary Insertion sort is an online sorting algorithm.
Select an option to see the answer and solution.
Q390
Open questionWhich of the following sorting algorithms is used along with quick sort to sort the sub arrays?
Select an option to see the answer and solution.
Q391
Open questionCocktail sort is a comparison based sort.
Select an option to see the answer and solution.
Q392
Open questionCycle sort is a comparison based sort.
Select an option to see the answer and solution.
Q393
Open questionWhat is the best case time complexity randomized quick sort?
Select an option to see the answer and solution.
Q394
Open questionWhich of the following data structure is required for the implementation of tree sort?
Select an option to see the answer and solution.
Q395
Open questionWhat is the average number of comparisons used in a heap sort algorithm?
Select an option to see the answer and solution.
Q396
Open questionWhat is the best case time complexity of bogosort?
Select an option to see the answer and solution.
Q397
Open questionThe given array is arr = {3, 4, 5, 2, 1}. The number of iterations in bubble sort and selection sort respectively are . . . . . . . .
Select an option to see the answer and solution.
Q398
Open questionIn heap sort, after deleting the last minimum element, the array will contain elements in?
Select an option to see the answer and solution.
Q399
Open questionMedian of three quick sort is a stable sort.
Select an option to see the answer and solution.
Q400
Open questionWhich of the following is not an advantage of tree sort?
Select an option to see the answer and solution.