Merge sort
Lesson 3 / 9
Lesson video
The video is not available yet.
Lesson slides
not available yet
Lesson details
Lesson outcome
I can perform a merge sort to order a list.
Show transcript
Merge sort splits items in lists into individual lists before merging pairs of lists together till all items are sorted.
Merge sort is an efficient “divide and conquer” algorithm that can perform well in real world use.
A merge sort algorithm is usually faster to execute but more complex to write than bubble sort.
Executing a merge sort takes up extra space in memory.
Worksheet
not available yet
Quizzes
This quiz is not available yet.
What pupils see
The same lesson as a pupil sees it. You can set any section as work on its own.
- IntroductionPrepare · Not available
- Starter quizActivate · Not available
- Lesson videoLearn · Not available
- Exit quizCheck · Not available
This content is by Cashar and published under an open licence.