This study notes covers Sorting Algorithm Comparison within Binary Search for GCSE Computer Science. Revise Binary Search in Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This topic appears less often, but it can still be a useful differentiator on mixed-topic papers. It is section 4 of 8 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.
Topic position
Section 4 of 8
Practice
15 questions
Recall
10 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 |