Algorithm Analysis Flashcards
1
Q
O(1)
A
Constant Time
2
Q
O(log n)
A
Logarithmic TIme
3
Q
O(n)
A
Linear TIme
4
Q
O(n log n)
A
N Log N Time
5
Q
O(n^p)
A
Polynomial Time
6
Q
O(k^n)
A
Exponential Time
7
Q
O(n!)
A
Factorial Time
8
Q
Time proportional to input size
A
Constant Time
9
Q
Time proportional to the logarithm of the input
A
Logarithmic Time
10
Q
Time linearly proportional to the size of the input
A
Linear Time
11
Q
Time proportional to n log n of input
A
N Log N Time
12
Q
Time proportional to polynomial exponent of input
A
Polynomial Time
13
Q
Time proportional to exponential growth of input
A
Exponential Time
14
Q
Time proportional to factorial of input
A
Factorial Time
15
Q
Loop running time is at most
A
The running time of the statements inside the loop multiplied by the number of iterations
