AQA A’Level SLR08 Algorithmic complexity, efficiency & permutation
About this video
AQA Specification Reference
A Level 4.4.4.1-4.4.4.2
In this video we look at a variety of concepts which are fundamental to algorithm complexity. The concepts in this video are an introduction to some basics before we dive into this topic in more detail in later videos.
Key questions:
- What is meant by an algorithm's complexity?
- What is the difference between time and space efficiency?
- What do we mean by the terms domain and codomain?
- What do we mean by the permutations of a set of objects or values?
00:00 Algorithmic complexity, efficiency and permutation
00:08 Intro
00:13 Introduction to the classification of algorithms
01:23 Comparing algorithms by expressing their complexity as a function relative to the size of the problem
06:07 Algorithm complexity recap
06:36 Time-efficient algorithms vs space-efficient algorithms
07:12 Permutation of a set of objects or values
07:49 A function maps one set of values onto another
08:48 Key questions
09:08 Outro
Last updated: 16.04.25
