Standard Searching Algorithms (OCR GCSE Computer Science): Flashcards
📚Flashcards
Practise the cards
12 cards from this deck
ShowHide
Practise the cards
12 cards from this deck
Linear search: examination method
Linear search: examination method
One by one
Linear search: starting point
Linear search: starting point
First item
Linear search: works on unsorted lists?
Linear search: works on unsorted lists?
Yes
Binary search: algorithm type
Binary search: algorithm type
Divide-and-conquer
Binary search: list requirement
Binary search: list requirement
Sorted list
Binary search: how it reduces search area
Binary search: how it reduces search area
Divides list in half repeatedly
Which is faster for large lists?
Which is faster for large lists?
Binary search
Which works on unsorted lists?
Which works on unsorted lists?
Linear search
Binary search: if item < middle item
Binary search: if item < middle item
Search left half
Binary search: if item > middle item
Binary search: if item > middle item
Search right half
Which is best for large sorted lists?
Which is best for large sorted lists?
Binary search
Which is best for small/unsorted lists?
Which is best for small/unsorted lists?
Linear search