In order to understand the advanced algorithm concepts like greedy methods and dynamic programming, one first need to be well versed in recursion.
I am relatively new to
Here is my simple test in Python:
def p(l, index): if index == len(l): return else: print l[index] index = index + 1 p(l, index)
and call:
p("123456", 0)