Sorting Algorithms

What is the key idea behind the Bucket Sort algorithm?

Which sorting algorithm is the best choice for sorting a small number of elements with a known range?

What is the average-case time complexity of Merge Sort?

Which sorting algorithm is described as an in-place algorithm but not stable?

Which sorting algorithm requires a specific implementation for handling large integer values?

What is the advantage of using TimSort over other sorting algorithms?

In which scenario would you prefer to use Shell Sort?

What is the time complexity of Heap Sort in the best case scenario?

Which sorting algorithm uses a divide-and-conquer approach but is not comparison-based?

What is the primary disadvantage of using Quick Sort?

Which of the following sorting algorithms has a worst-case time complexity of O(n log n) and is also stable?

How does Radix Sort handle sorting of large numbers efficiently?

What is the time complexity of Selection Sort in the average case?

Which sorting algorithm is best suited for sorting linked lists?

What is the key difference between Merge Sort and Quick Sort?

Which sorting algorithm is known for its worst-case time complexity being better than O(n 2 )?

What is the time complexity of Counting Sort when the range of input values is very large?

Which sorting algorithm works by dividing the array into smaller parts and sorting those parts using recursion?

What type of data structure is used in the implementation of Heap Sort?

Which algorithm is typically used in applications where the input size is very large and a stable sort is required?

Which of the following algorithm is implemented internally in java when we use function arrays.sort()?

What is the worst case running time of shell sort using Hibbard's increments?

Find the pivot element from the given input using median-of-three partitioning method. 8, 1, 4, 9, 6, 3, 5, 2, 7, 0.

Which of the following is an adaptive sorting algorithm?

Which of the following statement is true about comparison based sorting?

What is the worst case time complexity of recursive insertion sort?

What is the worst case time complexity of comb sort?

Any algorithm that sorts by exchanging adjacent elements require O(N 2 ) on average.

Quick sort follows Divide-and-Conquer strategy.

What is the worst case analysis of shell sort using Shell's increments?

What is the best case time complexity of binary insertion sort?

Which of the following is not true about tree sort?

Sleep sort does not work for . . . . . . . .

How many flips does the simplest of pancake sorting techniques require?

Shell sort is applied on the elements 27 59 49 37 15 90 81 39 and the chosen decreasing sequence of increments is (5,3,1). The result after the first iteration will be

Pancake Sorting appears in which of the following?

Which of the following is false?

What is the auxiliary space complexity of bottom up merge sort?

How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using bucket sort?

Which of the following algorithm is stable?

What is the time taken to perform a delete min operation?

Which of the following uses the largest amount of auxiliary space for sorting?

Which of the following is an in-place sorting algorithm?

What is the average case time complexity of standard merge sort?

What is the average case time complexity of binary insertion sort?

What is the best case time complexity of comb sort and bubble sort respectively?

Merge sort uses which of the following method to implement sorting?

The worst case time complexity of tree sort remains unaffected when implemented with an unbalanced tree or a balanced tree.

Library sort is an online sorting algorithm.

Sleep sort should be preferred over bogosort as it has better time complexity.

What is an in-place sorting algorithm?

Merge sort is preferred for arrays over linked lists.

Shell sort uses a sequence called a incrementing sequence to sort the elements.

Which of the following examples represent the worst case input for an insertion sort?

Which of the following is not true about MSD radix sort?

How many iterations are required to sort the array arr={2, 3, 4, 5, 1} using bubble sort and cocktail sort respectively?

Which of the following is a non-comparison sort?

How many sub arrays does the quick sort algorithm divide the entire array into?

What is the general form of Shell's increments?

What is the worst case time complexity of the Quick sort?

Which of the following is a comparison based sort?

What is the worst case time complexity of library sort?

Choose the incorrect statement about merge sort from the following?

What is the worst case time complexity of cycle sort?

The gap value after 3 iterations in an array with 6 elements will be . . . . . . . .

Which one of the following is a variation of Heap sort?

Heap sort is an implementation of . . . . . . . . using a descending priority queue.

Shell sort algorithm is an example of?

Choose the correct statement about bottom up merge sort from the following?

Which operation is most essential to the process of pancake sort?

Which among the following is the best cut-off range to perform insertion sort within a quick sort?

Gnome sort is also called . . . . . . . .

Which is the worst method of choosing a pivot element?

Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?

Counting sort is often used as a sub routine for radix sort.

Which of the following sorting algorithm was inspired by the natural phenomenon of falling objects?

Which of the following is a disadvantage of library sort when compared to insertion sort?

Which is the safest method to choose a pivot element?

What is the average time complexity of pigeonhole sort (k=range of input)?

Bogosort works by . . . . . . . .

What is the average case time complexity of library sort?

What is the best case efficiency of bubble sort in the improvised version?

What is an internal sorting algorithm?

Consider the original array 17 8 12 4 26. How many comparisons are needed to construct the BST on the original array?

Binary Insertion sort is an online sorting algorithm.

Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?

What is the auxiliary space requirement of Tim sort?

What is the best case time complexity of strand sort?

Which of the following is not an adaptive sorting algorithm?

Which of the following is true for the LSD radix sort?

What is the worst case time complexity of Tim sort?

Cocktail sort is a variation of . . . . . . . .

Which of the following sorting algorithm is used by C++ internally?

Which of the following sorting algorithm uses the method of insertion?

If Hibbard increments (h1 = 1, h2 = 3, h3 = 7, ..., hk = 2 k - 1) are used in a Shell sort implementation, then the best case time complexity will be . . . . . . . .

Which sorting algorithm is most appropriate for sorting linked lists?

Which sorting algorithm can be used to sort a large number of floating-point numbers efficiently?

Which sorting algorithm is known for its efficiency with partially sorted data?

What is the best-case time complexity of Quick Sort?

Which sorting algorithm works by repeatedly finding the minimum element from the unsorted portion?

What is the space complexity of Radix Sort?

In which situation is Merge Sort particularly useful?

Which sorting algorithm has a time complexity of O(n log n) in the worst case and is not stable?

What is the main drawback of Bubble Sort?

Which sorting algorithm is best for sorting strings of fixed length?

What is the recurrence relation for stooge sort?

Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?

What is the average case time complexity of cycle sort?

Which of the following sorting algorithm is in-place?

What is the worst case time complexity of odd-even sort?

The worst case running time of shell sort, using Shell's increments is?

Which of the following sorting algorithms can be considered as improvement to the binary tree sort?

Which of the following options contain the correct feature of an insertion sort algorithm?

What is the auxiliary space requirement of cycle sort?

Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if . . . . . . . .

Which of the following sorting algorithm is not in place?

Which of the following sorting algorithm is in place?

MSD radix sort should be preferred over LSD radix sort when we have to maintain the original relative order.

Which of the following sorting algorithm is a constituent of tim sort?

Randomized quick sort is a stable sort.

Introsort sort is a comparison based sort.

Which of the following methods is the most effective for picking the pivot element?

What is the average number of comparisons used to heap sort a random permutation of N distinct items?

Which of the following sorting algorithm is NOT stable?

On which algorithm is heap sort based on?

Which of the following is not true about QuickSort?

What is the average case time complexity of tree sort?

Which of the following is an advantage of recursive insertion sort over its iterative version?

Consider the following statements related to the binary tree sort. I. Element can be added gradually as they become available II. It needs extra memory space

What is the average time complexity of Tim sort?

What is a randomized QuickSort?

Which of the following is not an exchange sort?

Stooge sort is a comparison based sorting algorithm.

Bead sort is only applicable to positive integers.

Which of the following sorting algorithm has the same time complexity in every case?

What is the average case time complexity of bogosort?

Which of the following algorithm takes linear time for sorting?

What is the cut-off for switching from quick sort to heap sort in the implementation of introsort?

What is the auxiliary space complexity of recursive insertion sort?

What is the average case time complexity of gnome sort?

What is the disadvantage of counting sort?

Auxiliary space used by gnome sort is . . . . . . . .

What is the purpose of using randomized quick sort over standard quick sort?

What is the purpose of using a median of three quick sort over standard quick sort?

Bucket sort is a generalization of which of the following sort?

What is the worst case time complexity of cocktail sort?

What will be the recurrence relation of the code of recursive bubble sort?

Which of the following sorting algorithm is not a constituent of introsort?

How many write operations will be required to sort the array arr={2, 4, 3, 5, 1} using cycle sort?

What is the auxiliary space requirement of counting sort?

The initial gap between two elements being compared . . . . . . . .

What will be the pivot for the array arr={8, 2, 4, 9} for making the first partition when a median of three quick sort is implemented?

How many elements can be sorted in O(logn) time using Heap sort?

What is the auxiliary space complexity of tree sort?

What is the best case time complexity of cycle sort?

Which of the following algorithm is best suited for the case where swap operation is expensive?

What is the space complexity of pigeonhole sort (k=range of input)?

Bottom up merge sort is a stable sort.

What is the average case time complexity of odd-even sort?

Which of the following sorting algorithm does not use recursion?

Which of the following is a variation of bubble sort?

The worst case time complexity of insertion sort is O(n 2 ). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

Which of the following is not necessarily a stable sorting algorithm?

What is the average case complexity of bubble sort?

Comb sort is an improved version of . . . . . . . .

Quick sort uses which of the following algorithm to implement sorting?

What is the worst case time complexity of cube sort?

Merge sort can be implemented using O(1) auxiliary space.

What will be the best case time complexity of merge sort?

Quick sort uses join operation rather than merge operation.

What is the typical running time of a heap sort algorithm?

What is the worst case complexity of QuickSort?

What is its wort case time complexity of Heap sort?

What is the worst case time complexity of strand sort?

Which of the following is the most suitable definition of radix sort?

What is the auxiliary space complexity of a median of three quick sort?

Sleep sort can be preferred over which of the following sorting algorithms for large number of input elements?

What is the auxiliary space requirement of introsort?

An array that is first 7-sorted, then 5-sorted becomes . . . . . . . .

How many recursive statements are used in the algorithm of stooge sort?

In how many comparisons does the array arr={1, 4, 2, 3, 5} gets sorted if we use sleep sort?

What is the worst case time complexity of introsort?

Which of the following is correct with regard to insertion sort?

What is the space complexity of in place merge sort?

Sleep sort works by . . . . . . . .

Heap sort is faster than Shell sort.

Statement 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.

What is the average time complexity of randomized quick sort?

Bead sort is also known as . . . . . . . .

What is the average case complexity of selection sort?

Which of the following is not an example of non comparison sort?

Which of the following algorithm implementations is similar to that of an insertion sort?

Which of the following is not a stable sorting algorithm?

Which of the following sorting algorithm is only applicable to positive integers?

In which case will tim sort will work as an insertion sort?

In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean?

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

In the following scenarios, when will you use selection sort?

What is the first step in the algorithm of stooge sort(after base case)?

The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?

The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?

What will be the order of elements of the array arr = {23, 67, 143, 654, 43} after first iteration of MSD sort is complete?

Which of the following sorting algorithm is most closely related to the OS?

Why is Shell sort called as a generalization of Insertion sort?

Which of the following is an alternate name of MSD radix sort?

Given an array of the following elements 81, 94, 11, 96, 12, 35, 17, 95, 28, 58, 41, 75, 15. What will be the sorted order after 5-sort?

What is the cut-off for switching from quick sort to insertion sort in the implementation of introsort?

Auxiliary space requirement of sleep sort is . . . . . . . .

What is the best case complexity of QuickSort?

What is the best case time complexity of gnome sort?

Which one of the following sorting algorithm is best suited to sort an array of 1 million elements?

Which of the following is an advantage of recursive bubble sort over its iterative version?

It is not possible to implement counting sort when any of the input element has negative value.

Which of the following is the distribution sort?

Which of the following sorting algorithm will be preferred when the size of partition is between 16 and 2 log(n) while implementing introsort?

What is the worst case analysis of Shell sort using Sedgewick's increments?

What characteristic of TimSort helps it perform well on real-world data?

Which sorting algorithm performs the fewest number of swaps on average?

In which scenario does the Heap Sort algorithm perform best?

What type of sorting algorithm is Bucket Sort?

Which sorting algorithm does not work efficiently for arrays with large ranges of integer keys?

Shell sort is more efficient than insertion sort if the length of input arrays is small.

The given array is arr={7, 4, 5, 8, 1, 2}. The number of iterations required to sort the array using comb sort and bubble sort respectively will be . . . . . . . .

What is the auxiliary space complexity of merge sort?

What is the auxiliary space requirement of permutation sort?

Which of the following is an example of parallel sorting technique?

In insertion sort, the average number of comparisons required to place the 7 th element into its correct position is . . . . . . . .

Which of the following is not true about library sort?

Cycle sort is an adaptive sorting algorithm.

In binary tree sort, we first construct the BST and then we perform . . . . . . . . traversal to get the sorted order.

Which one of the following sorting algorithm requires recursion?

How many comparisons will be required to sort the array arr={5, 4, 7, 1, 9} using bead sort?

What is the other name for a shell sort algorithm?

Which of the following sorting algorithm is stable?

Which of the following statement is not a stable sorting algorithm?

The essential part of Heap sort is construction of max-heap. Consider the tree shown below, the node 24 violates the max-heap property. Once heapify procedure is applied to it, which position will it be in?

Brick sort uses which of the following methods for sorting the input?

What is the average time complexity of bead sort (S = sum of input elements)?

Which of the following is an advantage of binary insertion sort over its standard version?

Sleep sort does gives a correct output when . . . . . . . .

Which of the following sorting algorithm is not stable . . . . . . . .

Which of the following sorting algorithm is not in-place?

Binary insertion sort is a comparison based sort.

What is the running time of an insertion sort algorithm if the input is pre-sorted?

What is the space complexity of stooge sort?

What is the worst case time complexity of randomized quicksort?

What is the time taken to copy elements to and from two arrays created for deletion?

Which of the following is not true about bucket sort?

What is the worst case time complexity of permutation sort?

Pigeonhole sort is a stable sorting algorithm.

What is the average number of inversions in an array of N distinct numbers?

Cocktail sort uses which of the following methods for sorting the input?

Which of the following is Python's standard sorting algorithm?

The given array is arr = {2, 3, 4, 1, 6}. What are the pivots that are returned as a result of subsequent partitioning?

What is the average case running time of an insertion sort algorithm?

Recursive bubble sort is a comparison based sort.

Insertion sort is an example of an incremental algorithm.

Who invented the shell sort algorithm?

Which of the following method is used for sorting in merge sort?

How many arrays are required to perform deletion operation in a heap?

What is the average case time complexity of recursive insertion sort?

How many comparisons will be made in the worst case when an array of size n will be sorted by using a binary insertion sort algorithm?

In which of the following case stooge sort is most efficient (in terms of time complexity)?

Recursive insertion sort is a comparison based sort.

Which of the following real time examples is based on insertion sort?

Consider the following heap after buildheap phase. What will be its corresponding array?

Bottom up merge sort uses recursion.

Cocktail sort is also known as . . . . . . . .

What is the average running time of a quick sort algorithm?

Sleep sort code cannot compile online because . . . . . . . .

Which of the following sorting algorithm uses a binary search tree?

What is the worst case time complexity of a quick sort algorithm?

What is the auxiliary space complexity of recursive bubble sort?

In place merge sort has same time complexity as standard merge sort.

Odd-even sort is also known as . . . . . . . .

In what position does the array for heap sort contains data?

Strand sort is most efficient for data stored in?

What is the average time complexity of strand sort?

What is the auxiliary space complexity of binary insertion sort?

Bubble sort is an adaptive sorting algorithm.

How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using pigeonhole sort?

The auxiliary array used in pigeonhole sorting is called . . . . . . . .

Odd-even sort is a variation of . . . . . . . .

Bubble sort performs better as compared to cocktail sort.

Which of the following is an advantage of cycle sort?

Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it?

Sleep sort is an in-place sorting technique.

Which of the following sorting techniques is stable?

Which of the following sorting algorithm makes use of merge sort?

Merge sort uses which of the following algorithm to implement sorting?

What is the average time complexity of bottom up merge sort?

Which of the following is a combination of LSD and MSD radix sorts?

How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using counting sort?

Shell sort algorithm is the first algorithm to break the quadratic time barrier.

What is the advantage of pigeonhole sort over merge sort?

Which of the following is a variant of insertion sort?

The given array is arr = {2, 6, 1}. What are the pivots that are returned as a result of subsequent partitioning?

What are the number of swaps required to sort the array arr={1, 2, 4, 3, 7, 5, 6} using recursive bubble sort?

Bucket sort is an in place sorting algorithm.

Strand sort algorithm used which of the following method for sorting a list?

MSD radix sort is an in place sorting algorithm.

What is the best time complexity of bucket sort (k= number of buckets)?

What is the advantage of selection sort over other sorting techniques?

What is the best case time complexity of the binary tree sort?

What is the advantage of library sort over insertion sort?

What is the worst case complexity of bubble sort?

What is the auxiliary space complexity of randomized quick sort?

What is the best case time complexity of recursive bubble sort?

On how many increment sequences does the worst case analysis of shell sort depends?

What is the advantage of radix sort over quick sort?

Binary tree sort is an in-place sorting algorithm.

In which of the following case strand sort is most efficient?

What is the best case time complexity of cube sort?

Binary search can be used in an insertion sort algorithm to reduce the number of comparisons.

What is the worst case time complexity of gnome sort?

What is the worst case time complexity of merge sort?

Introsort begins sorting the given array by using which of the following sorting algorithm?

Quick Sort is a . . . . . . . .

What is the worst space complexity of bucket sort (k = number of buckets)?

How many odd and even phases are required respectively to sort the given array using odd-even sort.arr={3, 2, 3, 8, 5, 6, 2, 1}.

How many loops are required to implement gnome sorting algorithm?

Which of the following is a disadvantage of cube sort?

Which of the following is not an alternative name of permutation sort?

Comb sort is a stable sorting algorithm.

What is the auxiliary space complexity of library sort?

Choose the correct statement from the following.

What is the average time complexity of the median of three quick sort?

Which of the following is not in place sorting algorithm by default?

What is the auxiliary space requirement of cube sort?

Auxiliary space requirement of cocktail sort is . . . . . . . .

What is the best case time complexity of library sort?

What is the worst case complexity of selection sort?

Which of the following is not an alternative name of bogosort?

Stooge sort is a stable sorting algorithm.

Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for Tim sort implementation?

Which of the following sorting algorithms is the fastest for sorting small arrays?

In what time can a binary heap be built?

Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array?

What is the best case time complexity of tree sort?

Permutation sort works by . . . . . . . .

What is the auxiliary space complexity of bead sort?

Pigeonhole sort is an in place sorting algorithm.

Which of the following pair of sorting algorithms are stable?

Auxiliary space requirement of odd-even sort is . . . . . . . .

Which of the following is an example of an unstable sorting algorithm?

Bead sort is a comparison based sorting algorithm.

What is the average case time complexity of permutation sort?

Library sort is a comparison based sort.

Which of the following header file is a must to implement sleep sort algorithm?

Which of the following sorting algorithm uses a binary search?

Cocktail sort is a comparison based sort.

Cycle sort is a comparison based sort.

What is the best case time complexity randomized quick sort?

Which of the following data structure is required for the implementation of tree sort?

What is the average number of comparisons used in a heap sort algorithm?

What is the best case time complexity of bogosort?

The given array is arr = {3, 4, 5, 2, 1}. The number of iterations in bubble sort and selection sort respectively are . . . . . . . .

In heap sort, after deleting the last minimum element, the array will contain elements in?

Median of three quick sort is a stable sort.

Which of the following is not an advantage of tree sort?

Which of the following don't affect the time complexity of bucket sort?

Tim sort begins sorting the given array by using which of the following sorting algorithm?

What is the average case time complexity of recursive bubble sort?

What is the auxiliary space complexity of standard merge sort?

What is the median of three techniques in quick sort?

Which of the following is not true about radix sort?

The Pancake Problems (1975, 1979, 1973) did NOT involve which of the following people?

Insertion sort is an online sorting algorithm.

LSD radix sort is faster than comparison sorts.

What is the average case time complexity of merge sort?

Quick Sort can be categorized into which of the following?

Which one of the following is false?

For the best case input, the running time of an insertion sort algorithm is?

Which of the following is true?

What is the auxiliary space requirement of bogosort?

Strand sort is a stable sorting algorithm.

Auxiliary space used by comb sort is . . . . . . . .

Which of the following sorting algorithm requires the use of binary search in their implementation?

What is the best case time complexity Median of three quick sort?

Tim sort is a comparison based sort.

In C, what are the basic loops required to perform an insertion sort?

Which of the following sorting algorithms is closely related to shell sort?

The best case behaviour occurs for quick sort is, if partition splits the array of size n into . . . . . . . .

What is the best case time complexity of recursive insertion sort?

How many comparisons will be made to sort the array arr = {1, 5, 3, 8, 2} using MSD radix sort?

What is the best case time complexity of introsort?

Quick sort is a stable sorting algorithm.

Which of the following version of tree sort will have the highest worst case time complexity?

In average case Heap sort is as efficient as the Quick sort.

Quick sort uses which of the following method to implement sorting?

LSD radix sort is in-place sorting algorithm.

What is the average case time complexity of cube sort?

The gap between two elements being compared shrinks by a factor of . . . . . . . . after every iteration.

What is the best case time complexity of odd-even sort?

What is the worst case time complexity of binary insertion sort?

What is the auxiliary space complexity of strand sort?

What is the average case complexity of QuickSort?

How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort?

Cube sort is a comparison based sort.

The given array is arr = {1, 2, 3, 4, 5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are . . . . . . . .

Which of the following sorting algorithm is worst in terms of time complexity?

What is the best case complexity of selection sort?

Strand sort is a comparison based sorting algorithm.

Bubble sort is also known as . . . . . . . .

Which of the following non-comparison sort can also be considered as a comparison based sort?

What is the time complexity of Bubble Sort in the average case?

Which sorting algorithm is based on the divide-and-conquer strategy?

What is the space complexity of Merge Sort?

Which sorting algorithm uses a "pivot" element to partition the array into sub-arrays?

What is the primary advantage of Heap Sort over Quick Sort?

Which sorting algorithm is considered stable?

In which scenario does Insertion Sort perform best?

What is the worst-case time complexity of Quick Sort?

Which sorting algorithm is most efficient for sorting small arrays?

What is the primary disadvantage of using Counting Sort?

Consider the Quick sort algorithm in which the partitioning procedure splits elements into two sub-arrays and each sub-array contains at least one-fourth of the elements. Let T(n) be the number of comparisons required to sort array of n elements. Then T(n)<=?

What is the time complexity for a given pancake sort given it undergoes "n" flip operations?

What is the average time complexity of counting sort?

What is the best case time complexity of cocktail sort?

What is the best case time complexity of permutation sort?

What is the alternate name of bucket sort?

What is the worst case time complexity of tree sort (when implemented with a balanced tree)?

What is the worst case time complexity of the binary tree sort?

Which of the following sorting algorithms is the fastest?

In addition to the pancake sorting problem, there is the case of the burnt pancake problem in which we are dealing with pancakes (discs) that are burnt on one side only. In this case it is taken that the burnt side must always end up . . . . . . . .

In which of the following case does a tree sort become adaptive?

Time complexity of sleep sort can be approximated to be . . . . . . . .

What is the average time complexity of introsort?

Shell sort is also known as . . . . . . . .

In which of the following case pigeonhole sort is most efficient?

Median of three quick sort is an in place sort.

Which of the following sorting algorithm is best suited if the elements are already sorted?

The given array is arr = {1, 2, 4, 3, 5}.The number of iterations required to sort the array using gnome sort will be . . . . . . . .

What is the disadvantage of selection sort?

Gnome sort uses which of the following method to implement sorting?

What is the worst case time complexity of bucket sort (k = number of buckets)?

Shell sort is an improvement on . . . . . . . .

What is the worst case time complexity of tree sort (when implemented with an unbalanced tree)?

Which of the following algorithm takes non linear time for sorting?

Odd-even sort is a comparison based sort.

Which of the following is good for sorting arrays having less than 100 elements?

Which of the following sorting techniques is most efficient if the range of input data is not significantly greater than a number of elements to be sorted?

Quick sort is a space-optimised version of . . . . . . . .

What is the average time complexity of MSD radix sort (w= bits required to store each key)?

What is the average time complexity of stooge sort?

Library sort is a modified version of which of the following sorting algorithm?

What is the worst case time complexity of bogosort?

Cube sort is an in place sorting algorithm.

What is the worst case time complexity of LSD radix sort?

Why is heap sort preferred over merge sort for introsort implementation?

Which of the following combines qualities of MSD radix sort and LSD radix sort?

Randomized quick sort is an in place sort.

In-place merge sort is a stable sort.

Tree sort is an online sorting algorithm.

What will be the number of passes to sort the elements using insertion sort? 14, 12,16, 6, 3, 10

Which of the following is incorrect about randomized quicksort?

Which of the following is an alternate name of library sort?

Which of the following traversal in a binary search tree results in a sorted output?

What is the best case time complexity of Tim sort?

What is the advantage of counting sort over quick sort?

What is the worst case time complexity of bead sort (S= sum of input elements)?

What is the best case time complexity of bead sort (S = sum of input elements)?

LSD radix sort requires . . . . . . . . passes to sort N elements.

What is a randomized quick sort?

What is an external sorting algorithm?

What is the advantage of comb sort over merge sort?

Heap sort is an extremely stable algorithm.

Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.

Choose the correct statement regarding binary insertion sort?

Bucket sort is most efficient in the case when . . . . . . . .

What is the worst case time complexity of recursive bubble sort?

For the following question, how will the array elements look like after second pass? 34, 8, 64, 51, 32, 21

Which of the following should be used to sort a huge database on a fixed-length key field?

Which of the following is not a variant of merge sort?

Consider an array of length 5, arr[5] = {9, 7, 4, 2, 1}. What are the steps of insertions done while running insertion sort on the array?

When we realize a specific implementation of a pancake algorithm, every move when we find the greatest of the sized array and flipping can be modeled through . . . . . . . .

How many passes does an insertion sort algorithm consist of?

A machine needs a minimum of 200 sec to sort 1000 elements by Quick sort. The minimum time needed to sort 200 elements will be approximately . . . . . . . .

The descending heap property is . . . . . . . .

What is the usual size of a run in tim sort?

What is the full form of MSD in MSD radix sort?

Sleep sort should be preferred over permutation sort as it has better time complexity.

Introsort algorithm is combination of . . . . . . . .

The following function represents which sorting? void Sorting(int a[], int n)
{
bool swap = true

int first = 0

int last = n - 1

while (swap)
{

swap = false

for (int i = first

i < last

i++)
{
if (a[i] > a[i + 1])
{
swap(a[i], a[i + 1])

swap = true

}
}

if (!swap)
break

swap = false

--last

for (int i = last - 1

i >= first

i--)
{
if (a[i] > a[i + 1])
{
swap(a[i], a[i + 1])

swap = true

}
}

++first

}
}

The insert() procedure, given below, builds the BST on the input elements, which is the first step of the binary tree sort. Choose the correct to fill the condition. void insert(Tree* node, int newElement)
{
if(node== NULL)
{
node = createNewNode()

node-> value = newElement

node -> left = NULL

node -> right = NULL

return

}
else if(__________________)
{
insert(node->left, newElement)

}
else
{
insert(node->right, newElement)

}
}

Consider 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

}
} Which condition will correctly implement the while loop?

What will be the base case in the function of binary search used in the code of binary insertion sort? (high and low are the rightmost and leftmost index of array respectively and item is the element whose correct position is to be determined by the binary search function)

Which of the following code fragment puts sorted values in an array using beads correctly?

Consider the code given below, which runs insertion sort: void insertionSort(int arr[], int array_size)
{
int i, j, value
for (i = 1
i < array_size
i++)
{
value = arr[i]
j = i
while (________ )
{
arr[j] = arr[j − 1]
j = j − 1
}
arr[j] = value
}
} Which condition will correctly implement the while loop?

What will be the output of the given Java code? import java.util.Arrays
public class SortExample
{
public static void main(String[] args)
{
int[] arr = {10,7,9,5,8,4}
Arrays.sort(arr, 1, 3)
System.out.printf(Arrays.toString(arr))
}
}

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)
int a
for ( a = 0
a< n
a++)
cout << arr[a] << " "
return 0
}

What is the average time complexity of in place merge sort when we use the following function for merging? void in_place_merge(int arr[], int l, int middle, int r)
{
int start2 = middle + 1
if (arr[middle] <= arr[start2])
{
return
}
while (l <= middle && start2 <= r)
{
if (arr[l] <= arr[start2])
{
l++
}
else
{
int val = arr[start2]
int index = start2
while (index != l)
{
arr[index] = arr[index - 1]
index--
}
arr[l] = val
l++
middle++
start2++
}
}
}

What will be the base case for the code of recursive insertion sort ?

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+2, arr+n, greater<int>())
int a
for (int a = 0
a < n
a++)
cout << arr[a] << " "
return 0
}

There 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. }

There is one small error in the following flip routine. Find out which line it is on. 1 void flip(int arr[], int i)
2 {
3 int t, init = 0
4 while (init < i)
5 {
6 t = arr[init]
7 arr[i] = arr[init]
8 arr[i] = t
9 init++
10 i--
11 }
12 }

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
}

Which of the following statements is the basic for loop for a shell sort algorithm?

Choose the correct option to fill? X so that the code given below implements the Heap sort. #include <stdio.h>
void heapify(int arr[], int n, int i)
{
int largest = i
// Initialize largest as root
int l = 2*i + 1
// left = 2*i + 1
int r = 2*i + 2
// right = 2*i + 2
if (l < n && arr[l] > arr[largest])
largest = l
if (r < n && arr[r] > arr[largest])
largest = r
if (largest != i)
{
swap(arr[i], arr[largest])
heapify(arr, n, largest)
}
}
void heapSort(int arr[], int n)
{
for (int i = n / 2 - 1
i >= 0
i--)
heapify(arr, n, i)
for (int i=n-1
i>=0
i--)
{
X
heapify(arr, i, 0)
}
}
void printArray(int arr[], int n)
{
for (int i=0
i<n
++i)
printf(“%d”,arr[i])
printf(“
”)
}
int main()
{
int arr[] = {12, 11, 13, 5, 6, 7}
int n = sizeof(arr)/sizeof(arr[0])
heapSort(arr, n)
printf(“Sorted array is
")
printArray(arr, n)
}

Which of the following function chooses a random index as pivot.

What will be the base case for the code of recursive bubble sort?

What will be the output of the given Java code? import java.util.Arrays
public class SortExample
{
public static void main(String[] args)
{
// Our arr contains 8 elements
int[] arr = {10,7,9,5,8,4}
Arrays.sort(arr)
System.out.printf(Arrays.toString(arr))
}
}