>>Both points are correct. In some cases, however, it's very hard to write a non-recursive code. However, each recursive problem has non-recursive solution.
>
>Are you sure ?
According to the article in Wikipedia: "Any function that can be evaluated by a computer can be expressed in terms of recursive functions, without use of iteration, and conversely."
This seems to be the general belief; I am not sure whether it has actually been proven.
Difference in opinions hath cost many millions of lives: for instance, whether flesh be bread, or bread be flesh; whether whistling be a vice or a virtue; whether it be better to kiss a post, or throw it into the fire... (from Gulliver's Travels)
