Yes,you should avoid using recursion because it will need extra space . so for a big project you should avoid it. You can use it in loops where you have do some repeated(iterative ) task(ex.,factorial ,adding numbers ,Fibonacci numbers etc..) but when program size increases you should try to avoid it.

Writing is a process. “Recursive” simply means that each step you take in your writing process will feed into other steps: after you’ve drafted an essay, for instance, you’ll go do a bit of verification of some of your facts—and if you discover that you’ve gotten something wrong, you’ll go back to the draft and fix it.

Yes, Recursion is good practice. Many problem statements are recursive in essence: the best, most concise, clear and provably correct way to state the problem uses a recursive reference.

Recursive thinking is really important in programming. It helps you break down bit problems into smaller ones. Often, the recursive solution can be simpler to read than the iterative one.

But, well-known drawbacks of recursion are high memory usage and slow running time since it uses function call stack. Furthermore, every recursive solution can be converted into an identical iterative solution using the stack data structure, and vice versa.

There are no “necessary” uses of recursion. All recursive algorithms can be converted to iterative ones. Practically speaking, if you’re not using recursion for the following (even in imperative languages) you’re a little mad: Tree traversal.

Originally Answered: Do programmers and software engineers use recursion? Yes, programmers and software engineers use recursion. I would even add that, for some functional languages (like Haskell and Erlang), you cannot not use recursion (or, in other words, you must use recursion).

Recursion has more expressive power than iterative looping constructs. I say this because a while loop is equivalent to a tail recursive function and recursive functions need not be tail recursive. While loops that use mutable data. Tail recursive functions that use mutable data.

Is a while loop intrinsically a recursion? then, yes, a while loop is a form of recursion. Recursive functions are another form of recursion (another example of recursive definition).

Iterator and for-each loop are faster than simple for loop for collections with no random access, while in collections which allows random access there is no performance change with for-each loop/for loop/iterator.

In C#, the For loop is slightly faster. For loop average about 2.95 to 3.02 ms. The While loop averaged about 3.05 to 3.37 ms. As others have said, any compiler worth its salt will generate practically identical code.

Here I/O operation ( println ) is much slower than all possible overhead of calling lambda or creating an iterator. In general forEach might be slightly faster as it does everything inside the single method without creating the Iterator and calling hasNext and next (which is implicitly done by for-each loop).

Together with Java’s version of short lived anonymous functions, lambdas, they offer a way for developers to write concise and expressive code. That all said, a few developers I know have sworn off ever using streams due to a few slow benchmarks they’ve observed.

I’ve seen a lot of questions here about Java lambdas performance, but most of them go like “Lambdas are slightly faster, but become slower when using closures” or “Warm-up vs execution times are different” or other such things.