<[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] | the 0.409 vs 0.095 is the total times right? | so the imperative function is >4 times faster than the recursive. | or what does tottime stand for? | | is this always the case that the recursive function is slower? | the gain is less code? | | are some functions only implementable recursively?
Computers can be viewed as linear iteration machines implementing while True: execute next instruction and set next pointer appropriately But algorithms most naturally expressed with multiple recursion usually look more ungainly when linearized. -- http://mail.python.org/mailman/listinfo/python-list
