Introduction to Big O Notation with Python

preview_player
Показать описание
Errata @ 5:43 - Exponential should be Quadratic

A quick introduction to Big O Notation, including O(1) constant, O(N) linear, O(log N) logarithmic, and O(N²) quadratic. We'll use search (linear and binary) and sort (bubble) algorithms in Python to gain a better understanding of how Big O works practically
Рекомендации по теме
Комментарии
Автор

N^2 should not be called Exponential, that is growth of 2^N. N^2 is squadratic.

Aedalor
Автор

Another suggestion: At 6:25, it shows a bubble sort algorithm. At the very end it has an else statement. This should not be an else (it's not even aligned with the if so it's wrong) but the alignment should be the same and it should be replaced with a return statement, returning numbers

michelle
Автор

n = list(range(100))

def constant(n):
print(n)
return "Number of operations: " + str(1)

JJ_Luz