Virtual Labs

What is the primary strategy used in Quick Sort?

Divide-and-Conquer
Swapping adjacent elements
Merging subarrays
Building a heap structure

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

O(n)
O(n log n)
O(log n)
O(n²)

What is the role of the pivot element in Quick Sort?

It divides the array into two subarrays
It is swapped with adjacent elements
It is merged into the sorted array
It is used to build a heap

What is the space complexity of Quick Sort when implemented in-place?

O(n)
O(1)
O(n log n)
O(log n)

Which of the following is a disadvantage of Quick Sort?

It is not efficient for small datasets
It is not a stable sorting algorithm
It requires additional memory
It has high time complexity in all cases

Quick Sort