DSA + System design - 9

Which sorting algorithm perform worst for large dataset?

• Selection Sort

• Bubble Sort

• Insertion Sort

• Merge Sort

Which sorting algorithm is typically the best choice for small data sets?

• Insertion Sort

• Bubble Sort

• Quick Sort

• Merge Sort

In which scenario does the Insertion Sort algorithm perform the best?

• When the input is randomly ordered.

• When the input is in reverse order.

• When the input is almost sorted.

• When the input is large.

Which sorting algorithm is best suited for sorting a linked list?

• Quick Sort

• Merge Sort

• Heap Sort

• Insertion Sort

Which sorting algorithm always requires additional space proportional to the input size?

• Merge Sort

• Quick Sort

• Bubble Sort

• Selection Sort

Which sorting algorithm is particularly efficient for sorting data that fits into a limited range of integer values?

• Quick Sort

• Merge Sort

• Counting Sort

• Selection Sort

Which of the following sorting algorithms can be effectively parallelized?

• Quick Sort

• Merge Sort

• Heap Sort

• Bubble Sort

In which scenario does Quick Sort perform the worst in terms of time complexity?

• When the input is already sorted

• When the input is in reverse order

• When all elements are the same

• When the pivot selection is poor

• All of the above

An array with 20 elements is to be sorted using Radix Sort. If each element is a 3-digit number, how many times will Counting Sort be called during the sorting process?

• 20

• 10

• 5

• 3

Which of the following is true for a stable sorting algorithm?

• It always sorts in O(n log n) time

• It maintains the relative order of records with equal keys

• It requires additional space proportional to input size

• It is an in-place sorting algorithm