AP Computer Science A Quiz
20 questions · no time limit
0:00
Finish quiz
DATA COLLECTIONS
Question 1
of 20
Flag for review
No time limit
Current
Answered
Flagged
Not seen
Which of the following statements best describes the divide-and-conquer strategy used by the merge sort algorithm?
A
It finds the smallest element and places it at the beginning, dividing the list into sorted and unsorted parts.
B
It selects a pivot element and partitions the list into two sublists of smaller and larger elements.
C
It repeatedly divides the list in half until it has lists of size one, then merges them back together in sorted order.
D
It iterates through the list, inserting each element into its proper place in a sorted sublist.
YOUR PROGRESS
20
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
KEYBOARD
Pick an answer
A
B
C
D
Next question
↵
→
Previous
←
Flag for review
F