Mastering Sorting Techniques

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

• O(n log n)

• O(log n)

• O(n)

• O(n^2)

How does Merge Sort achieve its efficiency?

• Merge Sort achieves efficiency by sorting elements in O(n) time.

• Merge Sort relies on random sampling to improve sorting speed.

• Merge Sort is efficient because it uses a single loop to sort elements.

• Merge Sort achieves efficiency by using a divide-and-conquer strategy that consistently sorts in O(n log n) time.

In Quick Sort, what is the role of the pivot element?

• The pivot element helps partition the array for sorting.

• The pivot element is the first element of the array by default.

• The pivot element sorts the array in descending order.

• The pivot element is used to select the maximum value in the array.

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

• O(n)

• O(log n)

• O(n log n)

• O(n^2)

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

• Insertion Sort

• Selection Sort

• Merge Sort

• Bubble Sort

What is the main advantage of using Heap Sort?

• Uses less memory than Merge Sort.

• Faster than Quick Sort in all cases.

• Always sorts in linear time.

• Guaranteed O(n log n) time complexity in all cases.

How does Selection Sort work in terms of finding the minimum element?

• Selection Sort sorts the array by repeatedly merging two halves.

• Selection Sort finds the maximum element by iterating through the entire array.

• Selection Sort finds the minimum element by iterating through the unsorted portion of the array and swapping it with the first unsorted element.

• Selection Sort uses a binary search to find the minimum element.

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

• O(log n)

• O(n)

• O(n^2)

• O(n log n)

In which scenario does Quick Sort perform poorly?

• When the input array is already sorted or nearly sorted.

• When the input array has a small number of elements.

• When the input array contains random values.

• When the input array is in reverse order.

What is the space complexity of Insertion Sort?

• O(n log n)

• O(1)

• O(n)

• O(n^2)