i'm learning python and i ran into this problem, i read a little about O(n) and i think it's this kind of issue when performance is drastically reduced when n is a really big number, how to solve it when n is something like 123^123, independently of the code inside the for loop if it's 1 line or more. Maybe someone could point me to an algorithm that tackles this problem. for i in range(1, n+1): Continue reading...
