Informal Run-Time Analysis
AP Computer Science A · Flashcards
AP COMPUTER SCIENCE A · FLASHCARDS
Card 1
of 38
0 got it
0 to review
Current
Got it
Still learning
Not seen
QUESTION
Find the Big O for sorting a linked list using merge sort.
QUESTION
Identify the Big O for binary search in a sorted array.
QUESTION
Identify the Big O for the best-case of insertion sort.
Tap to flip before you grade
ANSWER
O
(
n
)
O(n)
O
(
n
)
. Array is already sorted requiring minimal operations.
Swipe → got it · swipe ← still learning
Got it
Still learning
Flip Card
Previous card
Next card