i got a warm feeling inside when he said "ok friends" at the end 🤗

You're a legend . You didn't just teach recursion, you taught us the base of an approach to a program, which many teachers omit. I always struggle in finding approaches so thanks a lot.

Please never discontinue this channel

I've been struggling with recursion for a long time until I found your playlist thank you so much

This is ridiculous! How is it that you are the most concise explaining this?! I am new to coding and I cannot believe that you just made this sooooo simple and understandable. Thank you so much for finally explaining why the heck I am using n - 1 in my recursive functions!!!!! Can i just love this video? I mean, "Like" just isn't enough. You are amazing.

Sir your teaching style is so good and so conceptual ..

This process was the key to unlocking recursion for me. Thank you so much for making it so clear!

I finally found the best programming teacher. I had trouble understanding our lessons at school so I kept on looking for many references online. And voila! I finally found the most concise and comprehensive explanation of the lesson ever Thank you so much Sir. You helped me a lot.

My go-to when teaching recursion is teaching students how to make a program such that you can list all file names in an array, given a directory. The sub-problem is putting all filenames into an array, and the complex problem is, when the file is a directory, doing the same procedure within. I use this as my go-to to explain recursion, and the results have been very positive. If you are someone who is trying to teach budding programmers, this has been a very solid approach. Just make sure to explain every little detail, including base-case (listing filenames in a directory), and then expanding that function into a recursive version.

Since you are only considering fac(1)=1 and not fac(0)=1 as a base value you will get a segmentation fault error if you try to find factorial of 0 because of infinite recursion.

Recursion concept can be confusing but this video makes it sounds so easy!! Super duper awesome! Easy to understand even for the first time studying this concept

I think this was one of the best channel to learn c language. Thank You sir.☺️ May God Bless You 💯 Keep Going ❤️

Your way of teaching in easier method is incredible 🙏🎉🎉🎉

I was looking for recursive for python tutorials ..the basic logic is so well explained, I could work this out as well. Thank you

Hi I really liked your videos specially on Recursion. Also since the name of the playlist includes data-structures , request you to include topics like Stacks, Queues,Trees,Graphs,Heaps and other data-structures too. A playlist on Algorithms will go a long way . The reason I am asking is you are really concise and deliver clearly the lectures .

Genuinely struggle to understanding most coding videos, but this just made sense and was very well explained!

Thank to you, now I understand how The recursion works, thank you so much.

Thanks for teaching the main thing is that approach to solve the problem that what i am looking for...

I was in a trouble in this part. But after watching this, I got a clear idea. Thank you very much

Ultimate teaching, after 2years now I had understood now only recursion basic❤❤

I just want to ask you 'Who is the lecturer of Digital Electronics Course of Neso Academy?, I want to thank him from anywhere I can do. It can be Linkedin, Facebook." Best Regards.

Thank you so much. Finally I understand how Recursive fuction does work.

Thank you for explaining this so nicely and systematically. I was stuck in a recursive function problem for a while, after watching this video it's now all clear for me. Thanks again.

It's just paved me a path that anything in coding is easy by you all persons . Be like this 👌 😌

I love you sir I understand so fast with this bless your soul

finally I learned the recusrion concept for you thank you so much sir you are the best god bless you neso academy and you dear sir ji

This video has become one of the best movements in my life 🥰... Thank you for clear explanation...

Great video - I finally understand how recursion works. I can also see how stack issues can occur now.

IVE BEEN WORKING ON THIS PROBLEM FOR 2 DAYS AND FINALLY GOT IT AFTER WATCHING UR VIDEO THANK YOUUUUUUUU 😭😭😭😭😭😭😭

The voice is so smooth 💞

NESO ACADEMY EXPLICITLY EXPLANATIONS ARE UNPRECEDENTED.

wonderful explanations! really loved it, i always get cleared with your explanations, thankyou a ton!

AWESOME dude !!! THEE BEST. most clear simple and best way what a great help in ubderstanding this VERY difficult subject matter; RECURSION. thank. YOU. SO. much. !!

I think this is the best exercise to learn Recursive Functions. Well done!

Thanks a ton, this is honestly one of the best videos on recuersion and helped me grasp it and apply it

“I understood recursion better after your explanation. Thank you, sir. I have a question. What happens if the argument is 0? Will the function keep calling itself with [0*fact(-1)] and so on?”

I have been banging my head for hours but this your lesson made it so easy! Thank you!

This would have been a great tutorial(it's good) if you did a dry run and explained how the program would execute(memory allocation in stack space and how the stack finally unwinds and actually calculates the factorial) before running it to find output. And the 'if statement' can be modified to check for zero as well.

I appriciate about your teaching, clear ,well understood

omg!!! this video is so helpful....can't thank you enough!!!

Did I just understand recursion...How?is?this?possible?

Sir you deserve some respect and appreciation for the quality content for free Thankyou from the bottom of my heart Stay blessed And keep doing the good work

Thank you! This was by far the best explanation for me.

Really it's the best playlist i found.

The best teaching method in world

Sir what you just taught is jem for me.. started feeling very confident in programing concepts. Thank you sir

👏👏This video is awesome. I learned so much in 10 munites. Thanks

woooow such a clean explanation. thanks a lot for your video.

Loved this video, everything is simply explained.

Old but Gold!

it should says ------------------------------- if (n ==0) return 1 ; -------------------------------- because 0! = 1 Thank you so much for the series

Sir the way you teach make me listen more and your voice is so warm🤍

Great explanation, it finally "clicked" for me!

May God bless you, about have Data structure exams and I really need this material

Beautiful explanation sir. Many thanks

It's an amz..aftr watching a lot of vedios..my all doubt is clr here...thnx

I didn't understand, but your voice is calming.

sir your way of teaching is amazing !!! sir please make videos on algorithm and data base management system as well.

thankyou very much....i was wasting my time to this topic before this was met....😘😘😘😘😘

Sir!!Awesome 🙂easily understandable way,,and ur explanation is like anyone can understand any topic in c

I would consider my Base case as if(n==1 || n==0) or simply if(n==0) because factorial of 0 is 1. so we have to keep this in mind if a user enters 0 value, so I believe your program will not work properly. Happy Coding...

thanks a lot sir for this great lecture

thank the lord that this channel exists omg

Soo simple and easy to understand .Thank you sir 😊😊

I appreciate your content and you are such a Great teacher ❤

Thank u sooo much sir. Lots of respect and love from Nepal...

Hi I think that you should start the base from 0 because 0 is considered an integer. Right now, if someone inputs 0 it won't work. Starting from 0 would be better I think. But nice video!

Great explanation, thank you sir!

sir you are amazing!

If you will become lecturer💝 in Any clg then Your salary is priceless💥

Lots of love to Ur hardwork from my behalf

Sir u make recurtion very easy for me.. thanks sir

omg , you are so good on teaching...

Wonderful teaching 👏

Thank you so much; you saved me in my project!

Woah outstanding teaching sir 👍

It is really nice but if we want to write factorial program then we simply write it with using loop int main() { int n,result=1; printf("enter the number = "); scanf("%d",&n); while(n !=0 ) { result=result*n; n=n-1; } printf("factorial of given is %d", result); } I want to know in which kind of program we need to use recursion or Without recursion it will not solve ?

First time I understand this recursion 😌😌

Damn! This is well put lecture. Amazing!

Sir, Tqqqq soooo much for gvg detailed explanation. Am searching for this type of explanation. Finally got it. Thanks a lot sir.

I used a ternary operator: #include int factorial(int n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); } int main() { int num; printf("Enter a number. "); scanf("%d", &num); printf("%d ", factorial(num)); return 0; }

Thank you, it was very helpful !!

Very nice video sir!

Sir happy new year sir . thank you so much for providing thic c program sir try to complete this course as early as possible

Kaaaaffiii Pyara explanation

thank you sir indian guy of youtube

thank you so much sir

hai sir your videos are a very big source to me...thank you. can you explain calling main function inside the main

I like the way you teach

This was awesome, this cleared my head.

Aap Bahut Ache Hai

great Job Neso

I am coming from CodeWithHarry youtube channel. Now I regret why I didn't came here first. I am too late now.

Thx sir, now I can pass my exam soon 😇🙏🏻

you are great sir

Best explanation 😍

Im from the future want to thanks a lot for helping me undestand this concept

Awesome tutorial

You are the best!

great explanation, thanks a lot!