Search Algorithms – Binary, Binary Tree, and Linear Search (AQA A-Level Computer Science): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Simplest search method
Simplest search method
Linear search
Linear search time complexity
Linear search time complexity
O(n)
Binary search data requirement
Binary search data requirement
Data must be sorted
Binary search time complexity
Binary search time complexity
O(log n)
Max comparisons for 1M records (binary search)
Max comparisons for 1M records (binary search)
20
MiddlePointer formula in binary search
MiddlePointer formula in binary search
When to move left in binary tree search
When to move left in binary tree search
Search value < current node
Binary tree search starting point
Binary tree search starting point
Root node
Best for dynamic/frequently changing data
Best for dynamic/frequently changing data
Binary tree search
Two factors for choosing search algorithm
Two factors for choosing search algorithm
Dataset size & data organisation