SHSubjectHub

Sorting: bubble sort and merge sort

AQA 75174.3 L4A-levelLesson 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.

  • 12 questions
  • 34 marks
  • about 40 minutes
  • marked instantly

Question types: short answer, multiple choice, matching, true or false.

Try it with a class, freeHow it works

Try one from this worksheet

A bubble sort puts the list 7, 4, 1, 6 into ascending order. Identify the list after the first pass.

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.3.5.1 Bubble sort · 4.3.5.2 Merge sort. C# lesson 4 of 5 in 4.3 Fundamentals of algorithms: a trace-one-pass Do Now, a short key idea, a 12-challenge ladder in three sets with exact test data, two exam questions and a worksheet. Replaces aqa-7517-4-3d-sorting.

19 slides.

Lesson outline

  1. Do Now: trace one pass
  2. Do Now: answers
  3. Key idea: Bubble sort, pass by pass
  4. Key idea: Two improvements, and the worst case
  5. Key idea: Two improvements, and the worst case: check your predictions
  6. Key idea: Merge sort: divide and conquer
  7. Key idea: The merge step, and why n log n
  8. Key idea: The merge step, and why n log n: check your predictions
  9. Set 1: bubble sort, pass by pass
  10. Set 2: count the work, then cut it
  11. Exam question E1: bubble sort
  12. Model answer E1
Unit bundle4.3 Algorithms · full C# lessons
Part of: 4.3 Algorithms · full C# lessons: the whole unitEvery resource in the unit in one zip.

More from 4.3 Algorithms · full C# lessons