B2.4.1 · Efficiency and memory
Logarithmic growth · O(log n)
Python · step by step
Logarithmic growth · O(log n)
Watch the number of marked operations as input size changes.
Python implementation
1visits = []23def growth_logarithmic(n):4 size = n5 while size > 1:6 visits.append(size)7 size = size // 28 return len(visits) visits is an instrumentation list used only to show work. Do not count this display logging when judging the underlying algorithm’s auxiliary space. We count append events, not every Python operation.
Keep exploring
Return to the algorithm efficiency lesson →
All B2.4 animations →