QuickSort Quiz

What is the average time complexity of QuickSort?

• O(n)

• O(n log n)

• O(n²)

• O(log n)

QuickSort is based on which algorithmic paradigm?

• Greedy algorithm

• Divide and Conquer

• Dynamic Programming

• Backtracking

What is the worst-case time complexity of QuickSort?

• O(n)

• O(n log n)

• O(n²)

• O(log n)

In QuickSort, what is the purpose of the "pivot" element?

• To divide the array into two equal halves.

• To compare all elements and partition the array.

• To merge two sorted subarrays.

• To randomly shuffle the array.

Which of the following is true about QuickSort?

• It is a unstable sorting algorithm.

• It requires additional memory for merging.

• It is an in-place sorting algorithm.

• It always has a time complexity of O(n log n).

What is the best-case time complexity of QuickSort?

• O(n)

• O(n log n)

• O(n²)

• O(log n)

Which of the following is a disadvantage of QuickSort?

• It is not an in-place algorithm.

• It has a worst-case time complexity of O(n²).

• It requires additional memory for recursion.

• It is not suitable for small datasets.

What is the key step in the QuickSort algorithm?

• Merging two sorted subarrays.

• Selecting a pivot and partitioning the array.

• Dividing the array into three equal parts.

• Swapping adjacent elements.

Which of the following is NOT a way to choose a pivot in QuickSort?

• Always pick the first element.

• Always pick the middle element.

• Always pick the last element.

• Always pick the smallest element.

What is the space complexity of QuickSort?

• O(1)

• O(n)

• O(log n)

• O(n log n)