Searching Algorithms
AP Computer Science A · Flashcards
AP COMPUTER SCIENCE A · FLASHCARDS
Card 1
of 40
0 got it
0 to review
Current
Got it
Still learning
Not seen
QUESTION
Which searching algorithm divides the dataset in half at each step?
QUESTION
What is an advantage of linear search?
QUESTION
How does binary search determine which half of the array to search next?
Tap to flip before you grade
ANSWER
Compares the middle element with the target. Comparison result determines which half to eliminate.
Swipe → got it · swipe ← still learning
Got it
Still learning
Flip Card
Previous card
Next card