1
Q
Excutes once
A
O(1)
2
Q
if a == 3:
print(“That’s good”)
A
0(1)
3
Q
One loop grows directly with data size
A
O(n)
4
Q
for i in range(n):
print(“That’s good”)
A
O(n)
5
Q
Halves data each time and is fast for large data
A
O(logn)
6
Q
while n > 1:
n = n / 2
A
O(logn)
7
Q
Loop and halve faster than O(n2)
A
O(nlogn)
8
Q
for i in range(n):
while n > 1:
n = n / 2
A
O(nlogn)
9
Q
Two nested loop
A
O(n2)
10
Q
for i in range(n):
for j in range(n):
print(“That’s good”)
A
O(n2)
11
Q
for i in range(2**n):
print(“That’s good”)
A
O(2n)
12
Q
Constant
A
O(1)
13
Q
Linear
A
0(n)
14
Q
Quadratic
A
O(n2)
15
Q
Logarithmic
A
O(logn)
Big O Notation
flashcards
Decks in class (1)
# Cards
