Chapter 3 DSA

used to replace loops.

data structures, like lists, arevery well-suited to processing by recursiveprocedures and functions

mathematically moreelegant than one using loops

a process wherby asequence of operations is executed repeatedlyuntil certain condition is achieved.

while, for or do..while.

algorithm calls itself.

Execution running time for recursivefunction is not efficient compared to loop, sinceevery time a recursive function calls itself, itrequires multiple memory to store the internaladdress of the function.

BASE CASE(S), RECURSIVE CASE(S

case(s) so simple that theycan be solved directly

more complex – makeuse of recursion to solve smaller subproblems & combine into a solution to the larger problem

There is one or moreterminal cases whereby the problem will be solvedwithout calling the recursive function again.

recursive call byreducing the size of the problem

• There’s a condition where the function will stopcalling itself. (if this condition is not fulfilled,infinite loop will occur)• Each recursive function call, must return to thecalled function.• Variable used as condition to stop the recursivecall must change towards terminal case.