What is Recursion? | Recursion Made Simple | Introduction to Recursive Methods | Geekific

Recursion can be tough to understand, especially for new developers. And simply put, a recursive method or function is one that calls itself. But while developing or writing a piece of code, how do we know that we should call the same method we are implementing? And how to ensure if we do this, that we will obtain the output and results we are seeking? In this video we answer all of these questions and more!

Timestamps:
00:00 Introduction
00:29 Practical Recursive Example
03:02 What is Recursion?
03:56 Stop or Abort Conditions
07:22 More Recursive Methods!
09:06 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:

#Geekific #Recursion #RecursiveMethods

[Mohamed-ufjh]

Your course are the good quality, and the content is very helpful and clear so, I'am surpise you dont have mutch viewer in the video I'am sorry :(

[sipungora]

You said that if we call a recursive method two times, we should have two stop conditions. But it is not always necessary, e.g. for dfs on a tree, we just have a single stop condition if(node == null) return smth. Although we call the dfs method recursively on the left and right sub-tree. Right?

[fishamus]

good video. Really good visuals as well.

[vengateshm]

Hey geefic! That's a cool stuff.
Please explain tail recursion and also the tree traversal using recursion.

[williammcenaney]

This excellent video told me why the recursive factorial function confused me. I would have understood that function if I calculated each factoial separately when I wanted to know what 5! equaled. I tried to memorize the function without thinking about what it meant. I acted like a Christian who believes you understand a Bible verse only if you memorized it.

By the way, recursive functions call copies of themselves.