#41 Python Tutorial for Beginners | Factorial using Recursion

You are the best , Sir.

I really appricated the level of explanation,👍😊

If only naruto knew this he wouldn't have failed the chunin return exams🤣🤣🤣

Fabulous Video....

Can anyone help with the code with user input. That would be helpful😊

Bravo sir!!

The way you explain is awesome❤
Thank You Sir

He showed how to teach in the coolest way possible 😎

oh my god. love you sir. you are my mentor.

Sir your really great 😊👍

great explained

awesome explaination never ever had this type of explaining a recurssion

Steve jobs

what a creativity level man

Very good editing Sir 👏

lol

Bruhhhh the editing 🎉

the best video in whole series lol😂

I can say out of all the videos in playlist this is the most ossm one, I used to have a bad perception about recursion but your video made it way much easier it to me. Thankyou :)

this funniest part was that he was calling himself 😂 best tutorial of my life

thanks for the video

Loved it, Naveen. Best explanation!

This video made 5years back,
Now im new to python language im watching this video .There is no any updation right the concepts he explained?

great editing sir, thanks for explanation

One of the best explanations 🎉

Besttttttttttttttttt Bestttttttttttttttttt Explanationnnnn ever seennnnnn ❤❤❤❤

LOL. Isn't that how Ravana character used to talk to himself in old movies?!?! :P

superb sir 🥳🥳🥳
wonderful explanation

def fact(n):
return 1 if n<=1 else n*fact(n-1)
result=fact(5)
print(result)

Awesome sir.....😅💖

The best recursion explained video ever. Great 💛

Happpned like magic to me 😀.

I get the concept of factorial, I just don't understand why I'm overthinking this whilie trying to onpterpret it into a code format.

🔥🔥🔥🔥🔥🔥🔥🔥

Vere level editing 🙏🥳

Nice way of explaining it !!!!

regarding recursion,
so here we are using fact(n-1) , which has same name as method, calling function again in a function and so it is recursion , is that right ?

Sir Reddy, you and your team are the best. The way you explained recursion was amazing, and you are truly helping me understand Python as clearly as possible. Thank you!

Amazing!!!!!

Good video, but where the n value is decreasing by 1 ? as it is returning always n* fact (n-1)

GOOD VEDIO SIR
THANKS SIR

still dont get it how this code calculates it.

Sir, I have never seen anyone teach in the way that you do, since last few days i have been started to follow your videos. you are great, take love from Bangladesh ❤❤❤

Sir,it is next level explaination

That’s a good answer.please mention edge cases in code while input is negative number.

Hats off to your effort !! very well explanations !!!

Awesome way of explaining. That's a different level of editing

Sir, the way you are explaining is simply superb👏👏