Back to marketplace
Section 8 Chapter 45 - Big-O Notation
No description yet. This curated deck is ready for daily study.
Total cards: 8•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (8)
#1
Front (Question)
What is a function in terms of mappings
Back (Answer)
It is a mapping from one set of values to another set of values (the domain to the co-domain)
#2
Front (Question)
Time complexity
Back (Answer)
The time that an algorithm takes to complete
#3
Front (Question)
Permutations
Back (Answer)
All the different ways of arranging a set of objects
#4
Front (Question)
Number of permutations
Back (Answer)
n!
#5
Front (Question)
How to express constant time with Big O notation
Back (Answer)
O(1)
#6
Front (Question)
How to express linear time with Big O notation
Back (Answer)
O(n)
#7
Front (Question)
How to work out the time complexity of a function
Back (Answer)
Look for the most important term (ignore all coefficients)
#8
Front (Question)
How to work out the time complexity of an algorithm
Back (Answer)
X nested for loops means complexity n^X Splitting the search space into pieces is log(n) Checking permutations is n!