Code sorting algorithms
Lesson 7 / 9
Lesson video
The video is not available yet.
Lesson slides
not available yet
Lesson details
Lesson outcome
I can trace code for a sorting algorithm to identify factors which may impact efficiency.
Show transcript
Code for sorting algorithms can be analysed by how efficient the algorithm is.
A trace table can be used to analyse an algorithm.
Bubble sort compares elements next to each other in the list and swaps them if they are in the wrong order.
A more efficient version of bubble sort uses a variable to flag when a swap was made during a single pass.
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.