You have to be joking. In the old days, recursion would often use more memory than a conventional iterative solution, because of growth of stack. Tail recursion, a more efficient form invented in the 1980s, has the same memory footprint as iteration.
Now that memory and processing are almost infinite, the key bottleneck is the ability of a programmer to understand a program. Recursion can often make programs shorter and simpler.
The bottleneck is the inability of the FIRST programmer to write non-obfuscated, non-spaghetti, clearly documented code.
The enemies are the bean counters (time) and business analysts (don't know what they want, but only how to say rather shakily, "I don't think that's quite what I wanted, but I don't know what I _do_ want."