Recursion and iteration

Recursion and iteration are both based on the control structure: iteration uses a repetitive structure, while recursion uses a Selective structure. Recurrence and iteration involve repetition: iterations explicitly use repetition structures, while recursion repeats through repeated function calls. Recursion and iteration both involve the termination test: iteration ends when the loop condition fails, and Recursion ends when the basic situation occurs. Using counters to control repeated iterations and Recursion gradually reach the end point: the iteration keeps modifying the counter until the counter value makes the loop condition fail; recursion continuously produces a simplified copy of the initial problem, until the basic information is reached. Iteration and Recursion can be performed infinitely: if the test of the cyclic condition never turns to false, iteration will have an infinite loop. If recursion can never be pushed back to the basic situation, infinite recursion will occur.
Recursion has many disadvantages. It repeats the call mechanism, so the overhead of repeated function calls is large, which takes a long processor time and a large amount of memory space. Every recursive call generates another copy of the function (actually only another copy of the function variable), which consumes a lot of memory space. Iterations usually occur in functions, so there is no overhead for repeatedly calling functions and assigning values to excess memory. So why do we choose recursion?