Sort, search and pathfinding algorithms compared by time and space

This week’s topics

Sort, search and pathfinding algorithms compared by time and space

1. A range of sort, search, and pathfinding algorithms
2. Sort, search, and pathfinding algorithms in terms of their space and time complexity

What you will be able to do

• 3.2 Describe a range of sort, search, and pathfinding algorithms.
• 3.5 Evaluate sort, search, and pathfinding algorithms in terms of their space and time complexity.

Activity

Start with this week’s 2 videos, then: Seminar, guided reading and a short written task: describe a range of sort, search, and pathfinding algorithms.

Study materials

Videos

• Comparing searching algorithms · Oak National Academy, Key Stage 4 (GCSE level) · for registered students
• Bubble sort · Oak National Academy, Key Stage 4 (GCSE level) · for registered students

Further resources

• Think Python, Appendix B: Analysis of Algorithms · PDF · Downey, Think Python 2e (Green Tea Press), Appendix B: counting steps, order of growth and comparing algorithms, pp. 201–209 · for registered students