Python 32-point lookup algorithm implementation

Time complexity: An object used to evaluate the efficiency of an algorithm's operation, i.e. (units)!

In general, algorithms with high time complexity are slower than algorithms with low complexity.

O (1) <o (LOGN) <o (n)

Efficiency is best for O (1), and the other decreases second.

In short, a few layers of the bad, is O (log2 N),

While n>1:  print (n)  N=N//2

　　

If n=64, the complexity is: O (log2 64) =6

Python 32-point lookup algorithm implementation