AQA A’Level SLR08 Comparison of the complexity of algorithms
About this video
AQA Specification Reference
A Level 4.4.4.2
This video takes a look at how we are able to compare the complexity of one algorithm against another using a method known as Big O notation.
Key questions:
- What is the difference between time and space complexity?
- What do we mean when we talk about an algorithm's performance in terms of best-, average-, and worst-case?
00:00 Comparison of the complexity of algorithms
00:05 Intro
00:09 A note about this video
00:25 Prior knowledge
01:05 Comparing the complexity of algorithms
02:09 Best, average and worst-case scenarios
03:03 Comparing the complexity of algorithms continued
07:34 Comparing searching algorithms
07:58 Comparing sorting algorithms
08:51 Key questions
09:06 Going beyond the specification
09:16 Big O (Ο) vs Big Omega (Ω) vs Big Theta (Θ)
10:09 Outro
Last updated: 16.04.25
