Back to marketplace
Big O notation and classification of algorithms
No description yet. This curated deck is ready for daily study.
Total cards: 7•Content version: v3•Public deck•Updated: 8/1/2026
Card preview (7)
#1
Front (Question)
What are the objectives for writing good code?
Back (Answer)
Efficiency, Time and Space
#2
Front (Question)
What is the key consideration of algorithms?
Back (Answer)
Input/problem size
#3
Front (Question)
What is a function?
Back (Answer)
It takes an input value and outputs a different one,
#4
Front (Question)
What is a domain?
Back (Answer)
The set of values that go into a function
#5
Front (Question)
What is a co-domain?
Back (Answer)
The set of values that possibly come out
#6
Front (Question)
What’s the range of a function?
Back (Answer)
The set of values actually produced by a function- a subset of the codomain
#7
Front (Question)
What is a permutation?
Back (Answer)
The number of ways n can be represented