Representing Algorithms - Bubble Sort and Merge Sort

This resource is Lesson 5 of 7 in my series and looks at the Bubble and Merge sorting Algorithms. The lesson is based on the latest AQA Computer Science 8525 specification (3.1.1 Representing Algorithms) however could still be used for OCR Computer Science AND Key Stage 3 lessons.

This lesson looks at the following objectives:

• Understand and explain how the Bubble Sort algorithm works.
• Understand and explain how the Merge Sort algorithm works.
• Compare and contrast Bubble and Merge sorting algorithms.

It also offers retrieval practice from lesson 4/7 by asking students to draw a mindmap on everything they remember about Linear and Binary search algorithms.

The following resources included for this lesson are:

Lesson PowerPoint
Worksheet in 2 formats (.docx and .pdf)

I use OneNote with my students so the above Worksheet is a template of what I distribute in each of the student notebooks.

Plenary activities are done by offering pre printed past exam question on the lesson topic or a pre-created quiz on blooket/kahoot on the lessons topic.