Q361
Open questionAn array that is first 7-sorted, then 5-sorted becomes . . . . . . . .
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
19/26
Page
Pick an option on a question to see the right answer and solution.
Q362
Open questionHow many recursive statements are used in the algorithm of stooge sort?
Select an option to see the answer and solution.
Q363
Open questionIn how many comparisons does the array arr={1, 4, 2, 3, 5} gets sorted if we use sleep sort?
Select an option to see the answer and solution.
Q364
Open questionWhat is the worst case time complexity of introsort?
Select an option to see the answer and solution.
Q365
Open questionWhich of the following is correct with regard to insertion sort?
Select an option to see the answer and solution.
Q366
Open questionWhat is the space complexity of in place merge sort?
Select an option to see the answer and solution.
Q367
Open questionSleep sort works by . . . . . . . .
Select an option to see the answer and solution.
Q368
Open questionHeap sort is faster than Shell sort.
Select an option to see the answer and solution.
Q369
Open questionStatement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order.
Statement 2: And these elements are the m smallest elements in the array.
Statement 2: And these elements are the m smallest elements in the array.
Select an option to see the answer and solution.
Q370
Open questionWhat is the average time complexity of randomized quick sort?
Select an option to see the answer and solution.
Q371
Open questionThere is a one line error in the following routine. Find that line.
1. int Max(int a[], int n)
2. {
3. int mi, i;
4. for (mi = 0, i = 0; i < n; i++)
5. if (a[i] > a[mi])
6. mi = i;
7. return mi;
8. }Select an option to see the answer and solution.
Q372
Open questionWhat is the worst case time complexity of randomized quicksort?
Select an option to see the answer and solution.
Q373
Open questionWhat is the time taken to copy elements to and from two arrays created for deletion?
Select an option to see the answer and solution.
Q374
Open questionWhich of the following is not true about bucket sort?
Select an option to see the answer and solution.
Q375
Open questionWhat is the worst case time complexity of permutation sort?
Select an option to see the answer and solution.
Q376
Open questionPigeonhole sort is a stable sorting algorithm.
Select an option to see the answer and solution.
Q377
Open questionWhat is the average number of inversions in an array of N distinct numbers?
Select an option to see the answer and solution.
Q378
Open questionCocktail sort uses which of the following methods for sorting the input?
Select an option to see the answer and solution.
Q379
Open questionWhich of the following is Python's standard sorting algorithm?
Select an option to see the answer and solution.
Q380
Open questionThe given array is arr = {2, 3, 4, 1, 6}. What are the pivots that are returned as a result of subsequent partitioning?
Select an option to see the answer and solution.