81. What is the average time complexity of pigeonhole sort (k=range of input)?
82. What 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;
}
#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;
}83. Bogosort works by . . . . . . . .
84. What is the average case time complexity of library sort?
85. What is the best case efficiency of bubble sort in the improvised version?
86. What is an internal sorting algorithm?
87. Consider the original array 17 8 12 4 26. How many comparisons are needed to construct the BST on the original array?
88. Which of the following statements is the basic for loop for a shell sort algorithm?
89. Binary Insertion sort is an online sorting algorithm.
90. Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.