Lesson: Merge sort, (lesson plan & x 6 resources)
(GCSE Computer Science)
鈥� To understand and explain how a merge sort works
- An easy to follow and timed lesson plan (x1 hour) that includes x6 resources.
- Starter activity where pupils compare the performance of the bubble and merge sort.
- A merge sort presentation that introduces and explains the sorting algorithm (divide & conquer)
- A link to a merge sort simulation demonstrates a working model
- An worksheet exercise to dry run the merge sort algorithm (answers provided)
- There is a sample merge sort written in python that the pupils edit and make changes.
- A stretch and challenge exercise to program the first half of the merge sort.
- A plenary exercise containing an x8 question assessment on the merge sort
- A homework to represent the performance of the bubble and the merge sort on a chart
Get this resource as part of a bundle and save up to 25%
A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.
Something went wrong, please try again later.
This is a very well organised set of resources. There is python code for a bubble sort and merge sort, which can be used to show how long each sort takes. There is a very clear powerpoint presentation showing a single sort. There is a worksheet with a nice merge sort diagram for students to fill in (the best I could find of its sort). I had to replicate the worksheet as one question doesn't take students long at all. All in all, a good resource. 4 stars as it cost money!
to let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£4.00