Q181
Open questionWhat is the typical running time of a heap sort algorithm?
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
10/26
Page
Pick an option on a question to see the right answer and solution.
Q182
Open questionWhat is the worst case complexity of QuickSort?
Select an option to see the answer and solution.
Q183
Open questionWhich of the following sorting algorithm is in-place?
Select an option to see the answer and solution.
Q184
Open questionWhat is its wort case time complexity of Heap sort?
Select an option to see the answer and solution.
Q185
Open questionWhat is the worst case time complexity of strand sort?
Select an option to see the answer and solution.
Q186
Open questionWhich of the following is the most suitable definition of radix sort?
Select an option to see the answer and solution.
Q187
Open questionWhat is the auxiliary space complexity of a median of three quick sort?
Select an option to see the answer and solution.
Q188
Open questionSleep sort can be preferred over which of the following sorting algorithms for large number of input elements?
Select an option to see the answer and solution.
Q189
Open questionWhat is the auxiliary space requirement of introsort?
Select an option to see the answer and solution.
Q190
Open questionWhich of the following is false?
Select an option to see the answer and solution.
Q191
Open questionLibrary sort is a modified version of which of the following sorting algorithm?
Select an option to see the answer and solution.
Q192
Open questionWhat is the worst case time complexity of bogosort?
Select an option to see the answer and solution.
Q193
Open questionCube sort is an in place sorting algorithm.
Select an option to see the answer and solution.
Q194
Open questionWhat is the worst case time complexity of LSD radix sort?
Select an option to see the answer and solution.
Q195
Open questionWhy is heap sort preferred over merge sort for introsort implementation?
Select an option to see the answer and solution.
Q196
Open questionWhich of the following combines qualities of MSD radix sort and LSD radix sort?
Select an option to see the answer and solution.
Q197
Open questionRandomized quick sort is an in place sort.
Select an option to see the answer and solution.
Q198
Open questionIn-place merge sort is a stable sort.
Select an option to see the answer and solution.
Q199
Open questionTree sort is an online sorting algorithm.
Select an option to see the answer and solution.
Q200
Open questionConsider the following code snippet, which implements the Shell sort algorithm.
shellSort( int elements[], int num_elements , int incrmnts[], int num_incrmnts)
{
int incr, j, k, span, y;
for(incr = 0; incr ;< num_incrmnts; incr++)
{
span = incrmnts[incr]; data-structure-questions-answers-shell-sort
for( j = span; j < num_elements; j++)
{
k = j;
y = elements[j];
while (________ )
{
elements [ k] = elements[k - span];
k = k - span;
}
elements[k] = y;
}
}Select an option to see the answer and solution.