upd chapter_01/binary.py
We have to perform N swaps a total of N times. This takes N^N steps, therefore:
This algorithm has time complexity O(N^2)
O(N^2)
Technically (n – 1, n - 2 ... 2, 1 ~= N/2) swaps are performed but in BigO the constants are dropped.
n – 1, n - 2 ... 2, 1
