Back to marketplace
2.3.4 Searching Algorithms
No description yet. This curated deck is ready for daily study.
Total cards: 7•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (7)
#1
Front (Question)
Which searching algorithm requires data to be sorted?
Back (Answer)
Binary search
#2
Front (Question)
What is the time complexity of binary search?
Back (Answer)
O(log n)
#3
Front (Question)
What is the time complexity of linear search?
Back (Answer)
O(n)
#4
Front (Question)
Outline the stages of a binary search.
Back (Answer)
Compare the middle element with item to be found If not found, move to left half (smaller) or right half (greater) Repeat until found or no more items to search
#5
Front (Question)
Outline the stages of a linear search.
Back (Answer)
First item examined If not found, next item examined Repeated until found or end of list reached
#6
Front (Question)
What data sets does linear search work best for?
Back (Answer)
Unordered, small data sets
#7
Front (Question)
What data sets does binary search work best for?
Back (Answer)
Ordered, large data sets