This introduction covers Putting Things in Order 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 2 of 8 in this topic. Use this introduction to connect the idea to the wider topic before moving on to questions and flashcards.
Topic position
Section 2 of 8
Practice
15 questions
Recall
10 flashcards
Putting Things in Order
Bubble sort is like bubbles rising in water - compare neighbours, swap if wrong order, biggest values "bubble up" to the end. Keep passing through until no swaps needed. Insertion sort is like sorting cards in your hand - pick each card and insert it into the correct position among the cards you've already sorted. Merge sort is like sorting by splitting a deck in half repeatedly, then merging back in order.