the caller and continue execution of that method execution in the caller is contiued at the next statementor expression after the recursive call was made in the fibonacci algorithmsrecursive case we make two recursive calls when the first recursive call (fibonacci( )returns to the caller we then execute the the second recursive call (fibonacci( )after both recursive calls have returned to their callerthe caller can then subesequently return to its caller and so on recursive algorithms are much easier to demonstrate diagrammatically as figure demonstrates when you come across recursive algorithm draw method call diagrams to understand how the algorithm works at high level summary understanding algorithms can be hard at timesparticularly from an implementation perspective in order to understand an algorithm try and work through it using trace tables in cases where the algorithm is also recursive sketch the recursive calls out so you can visualise the call/return chain in the vast majority of cases implementing an algorithm is simple provided that you know how the algorithm works mastering how an algorithm works from high level is key for devising well designed solution to the problem in hand