This study notes covers Sorting Algorithm Comparison within Binary Search for GCSE Computer Science. Revise Binary Search in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This is a high-frequency topic, so it is worth revising until the explanation feels precise and repeatable. It is section 4 of 9 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.
Sorting Algorithm Comparison
| Algorithm | How it Works | Complexity | Good For |
|---|---|---|---|
| Bubble Sort | Compare adjacent pairs, swap if wrong order, repeat | O(n²) | Small lists, nearly sorted data |
| Insertion Sort | Insert each element into correct position in sorted portion | O(n²) | Small lists, nearly sorted data |
| Merge Sort | Divide list in half, sort each half, merge together | O(n log n) | Large lists, guaranteed performance |
Practice questions for Binary Search
Which of the following is a requirement before binary search can be used?
Describe how a binary search algorithm finds a target value in a sorted list.
Quick recall flashcards
What is the time complexity of binary search?
O(log n) - logarithmic time
What technique does binary search use?
Divide and conquer - repeatedly halves the search space