Big-O notation

• Informatica
• Middelbare school
• vwo
• Leerjaar 6

Big-O notation is hetzelfde als

1. best-case scenario
2. worst-case scenario
3. average case scenario

O(1)

O(logn)

O(n)

O(n log n)

O(n^2)

O(2^n)

O(n!)

y = 100 + (2 * 10)
for x in [1,2,3,4]:
print(x * x)

1. O(1)
2. O(n)
3. O(log n)
4. O(n log n)

lijst = [1,2,3,4,5]
for item in lijst:
for item2 in lijst:
print(item + item2)

1. O(1)
2. O(n)
3. O(log n)
4. O(n^2)

x = 100 * 2^2
y = 5 + (15 * 20)
print(x + y)

1. O(n)
2. O(n^2)
3. O(1)
4. O(log n)

1. O(1)
2. O(n)
3. O(2 ^ n)
4. O(n ^2)

Linear search (met een lijst) is

1. O(1)
2. O(n)
3. O(n log n)
4. O(n^2)

Binary search is

1. O(n)
2. O(log n)
3. O(n log n)
4. O(1)

Mergesort is

1. O(1)
2. O(n log n)
3. O(log n)
4. O(n^2)