ahmed writes:
> So we had to do a project for our python class and we came across a
> recursive problem. The code we had to write was as follows:
>
> T(n)
> if n == 1
> return 1
> else
> for any number(k) between 1 and n - 1
> 2 * T(n-k) + 2^i - 1
>
> from this
So we had to do a project for our python class and we came across a recursive
problem. The code we had to write was as follows:
T(n)
if n == 1
return 1
else
for any number(k) between 1 and n - 1
2 * T(n-k) + 2^i - 1
from this we need to get the minimum number which would be produced depending
Title: RE: renaming 'references' to functions can give recursive problems
[Fredrik Lundh]
#- you're confused. resetting your brain and reading the documentation
#- again might help:
#-
#- http://docs.python.org/ref/objects.html
#- http://docs.python.org/ref/naming.html
This artic
