Test yourself on Linear Search with exam style questions, marked instantly.
Flashcards that come back just before you would forget them.
A revision plan that remembers what you know and shows what to do next.
See which topics you have nailed and which need another look.
Quiz yourself on Linear SearchGet your flashcardsBuild my revision planTrack my progressComparison
| Aspect | Linear Search | Binary Search |
|---|---|---|
| How it works | Check each item from start to end | Divide list in half each time |
| Requires sorted data? | No | Yes |
| Best case | 1 comparison (first item) | 1 comparison (middle item) |
| Worst case (n items) | n comparisons | About one extra check each time the list doubles (1,000 items: up to 10 checks) |
| Example: 1000 items | Up to 1000 checks | Up to 10 checks |
| Speed on large lists | Slower: may check every item | Much faster: halves the list each time |
Make this stick
Signing in gives access to all PrepWise features.