Quick Sort (OCR A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What strategy does Quick Sort use?
What strategy does Quick Sort use?
Divide-and-conquer
During partitioning, where do elements smaller than the pivot go?
During partitioning, where do elements smaller than the pivot go?
To the left
What memory characteristic does Quick Sort have?
What memory characteristic does Quick Sort have?
In-place, minimal extra memory
What is Quick Sort's best and average case time complexity?
What is Quick Sort's best and average case time complexity?
What is Quick Sort's worst case time complexity?
What is Quick Sort's worst case time complexity?
When does Quick Sort's worst case occur?
When does Quick Sort's worst case occur?
Poor pivot division of array
What happens after the partition step in Quick Sort?
What happens after the partition step in Quick Sort?
Recursively apply to sub-arrays
What condition allows Quick Sort recursion to continue?
What condition allows Quick Sort recursion to continue?
low < high
What can always choosing the first/last element in a sorted array cause?
What can always choosing the first/last element in a sorted array cause?
Performance degrades to
Which strategy can improve Quick Sort's pivot selection?
Which strategy can improve Quick Sort's pivot selection?
Random pivot selection
What can cause incorrect element placement in Quick Sort?
What can cause incorrect element placement in Quick Sort?
Mismanaging i and j indices
What step is crucial for correctly implementing Quick Sort?
What step is crucial for correctly implementing Quick Sort?
Understanding partitioning