But only if you can split parts more or less evenly; in other case, numbers go down quickly...
Re:Python to Scheme to Assembly (2014)
by emmanueloga_ on Tuesday March 24, 2015 @01:24PM
(#9257999)
True, in which case you can take some measures to avoid worst case inputs... I'm thinking randomization in quicksort, for instance.
log2 1_000_000_000_000_000 => 49.82892142331043
"Recursion and iteration are equally expressive: recursion can be replaced by iteration with an explicit stack, while iteration can be replaced with tail recursion. Which approach is preferable depends on the problem under consideration and the language used." [1]
BTW, I sympathize with the author's thesis. I was trying to remember algorithms that are easier to reason about in their iterative form... but I can't remember any. Conversely, compare recursive vs iterative DFS [2].
1: http://en.wikipedia.org/wiki/Recursion_(computer_science)
2: http://en.wikipedia.org/wiki/Tree_traversal#Depth-first_2