1
Q
Asymptotic time complexity
A
The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation
2
Q
Big-O
A
Asymptotic runtime, expressed as function of the size of inputs, consider best, worst and average cases
3
Q
O(n!) Complexity
A
Horrible
4
Q
O(2^n) Complexity
A
Horrible
5
Q
O(n^2) Complexity
A
Horrible
6
Q
O(n log n) Complexity
A
Bad
7
Q
O(n)
A
Fair
8
Q
O(log n) Complexity
A
Good
9
Q
O(1) Complexity
A
Good
SMInterviewPrep
flashcards
Decks in class (11)
# Cards
