Algorithmic Efficiency
AP Computer Science Principles · Flashcards · Application
AP COMPUTER SCIENCE PRINCIPLES · FLASHCARDS
Card 1
of 3
0 got it
0 to review
Current
Got it
Still learning
Not seen
QUESTION
Find and correct the error: 'BFS has a space complexity of
O
(
E
)
O(E)
O
(
E
)
.'
QUESTION
Find and correct the error: 'A binary search has
O
(
n
)
O(n)
O
(
n
)
complexity.'
QUESTION
Find and correct the error: 'The time complexity of merge sort is
O
(
n
2
)
O(n^2)
O
(
n
2
)
.'
Tap to flip before you grade
ANSWER
Correct: 'The time complexity of merge sort is
O
(
n
log
n
)
O(n \text{ log } n)
O
(
n
log
n
)
.'. Merge sort consistently divides and merges efficiently.
Swipe → got it · swipe ← still learning
Got it
Still learning
Flip Card
Previous card
Next card