Sorting Algorithms
OCR J2772.1eGCSELesson packSubscription
Also online
This worksheet marks itself
Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.
- 8 questions
- 25 marks
- about 20 minutes
- marked instantly
Question types: ordering, short answer, multiple choice, matching, true or false.
Try one from this worksheet
Which sorting algorithm uses a 'divide and conquer' approach?
Pick an answer: it's marked straight away, just as your pupils would see it.
About this resource
Understand and compare bubble sort, merge sort and insertion sort - including their steps, efficiency, and when each is most suitable.
16 slides.
Lesson outline
- Why Sort Data?
- Bubble Sort
- Bubble Sort - Worked Example
- Bubble Sort Check
- Merge Sort
- Merge Sort - Worked Example
- Merge Sort - Visual Walkthrough
- Task 1 - Bubble Sort & Merge Sort
- Insertion Sort
- Sorting Algorithm Check
- Comparing the Three Sorting Algorithms
- Sorting Algorithms Visualiser
Unit bundle2.1 Algorithms
More from 2.1 Algorithms
- Lesson pack · 2.1aComputational ThinkingFree
- Lesson pack · 2.1bDesigning Algorithms: Flowcharts & PseudocodeSubscription
- Lesson pack · 2.1cTrace Tables & Identifying ErrorsSubscription
- Lesson pack · 2.1dSearching AlgorithmsSubscription
- Knowledge organiser · 2.1AlgorithmsSubscription
- Scheme of work · 2.1AlgorithmsSubscription


