I'm in bca 1st year i don't have any kind of computer subjects in 12th and now I'm learning python so it's very very important topic i guess and yess.....a very good explanation 🎉🎉
Def fibo(n): If n==1: Return 0 If n==2: Return 1 Return ( fibo(n-1)+fibo(n-2)) n=int(input("enter the number of terms")) For i in range(1,n+1): Print(fibo(i))
Thank you sir you explained so simply I watched so many video of recursion I don't understand at all your video cleared my doubt permanently thank you sir😊
Thank you so much sir for teaching such concepts with such easy methods. I am right now in iit mandi, and in my first year (data science and algorithm) I am still referring to your videos. Thank you
If I had found your channel sooner, I would have been a better programmer by now. How did you learn to code like that Sir ? It's an art, I shall never forget Fibonacci series ever again!!!!
awesome explanation sir......... you just rocked and it was a extreme level explational, want it in english language so that other state students can gain it.
Sir ek question tha ki jab fibo (3)+fibo (2) call hota hai function kai ander toh woo def fibo (n) kai pass jaiga as per recursion rule lekin wo return print (fibo (i)) kai kyu jra hai sir thoda sa doubt app clear krdai toh acha rheta
sir 1 doubt ... iss program mein function ko toh loop ke zariye baar baar call kiya ja raha hai par recursion mein toh function ke andar hi function ko call karte hain na ?
Very Great Sumit! You are like (beef/meat) in biryani without it there's no feeling of joy in eating. May I know is there paid tutorial for python in which you are teaching?
sir but in fibonacci series term starts from 0 like 0th term, 1st term ..... example - in your case if n = 4 then 4th term is 2 but sir I have checked and found that at n = 4 then 4th term is 3 like term starts from 0th term , 1st term.... plz clarify this.
So pahli baat, aapko tamij honi chahie ki aap ek teacher se baat kar rahe ho. Dusari baat program bilkul sahi hai, kuch bhi comment karne se pahle use jarur check kar liya jaata hai, kuch bhi jo mann me aae bol nahi dete hai... def fibo(n): if(n==1): return 0 if(n==2): return 1 return(fibo(n-1)+fibo(n-2)) n=int(input("Enter Number of Terms:")) for i in range(1,n+1): print(fibo(i))
I'm in bca 1st year i don't have any kind of computer subjects in 12th and now I'm learning python so it's very very important topic i guess and yess.....a very good explanation 🎉🎉
Keep learning😊
I have no words for u sir , ur explanation is quite outstanding i request u to please don't stop to making these C.S related videos
Def fibo(n):
If n==1:
Return 0
If n==2:
Return 1
Return ( fibo(n-1)+fibo(n-2))
n=int(input("enter the number of terms"))
For i in range(1,n+1):
Print(fibo(i))
Glt hai D,I,P,R,F small honge🙂🙂
Really outstanding sir..... Thank u soo much for making those videos and clearing our doubts.
So nice of you!
Thank you sir for this video,,u clear all doubts 👍🏻
Always welcome Urvashi !
Thank you so much sir I'm not good in computer science but you cleared all my doubts and make it so easy to understand
So nice of you dear, keep learning😊
Thank you sir you explained so simply I watched so many video of recursion I don't understand at all your video cleared my doubt permanently thank you sir😊
My pleasure Kunal, keep learning😊
Best channel ever for CS students
😊
outstanding, have no words to describe your skills.
Excelent video on Recursion. Thanks a lot for sharing your knowledge.
maine bhut video dekhi but you are the best sir keep on
Thanks Shiv Rana!
Thank you so much sir for teaching such concepts with such easy methods.
I am right now in iit mandi, and in my first year (data science and algorithm) I am still referring to your videos.
Thank you
Most welcome Vershita, keep learning🙂
God bless you!
Very impressive and tradition way of our college time .. Appreciated.
Thanks Amitesh😊
I want to say you thank you . Very very good explaning , Superb , Very helpful video.
Most welcome Satyam... God bless you!
This is my first time I have seen this such an amazing lecture .thank you sir.
Thanks & most welcome dear, keep learning😊
If I had found your channel sooner, I would have been a better programmer by now. How did you learn to code like that Sir ? It's an art, I shall never forget Fibonacci series ever again!!!!
Amazing explanation sir👍👍👍👍
Thanks Raghav!
A great thanks sir...really well explained...❤🎉
Most welcome 😊
Love Sir 💗💗 you clear my all doubt
🙂👍
awesome explanation sir......... you just rocked and it was a extreme level explational, want it in english language so that other state students can gain it.
Thank you so much sir 🌼you explained everything easily and i understood 👍
That's good👍
Keep learning😊
Sir I can't explain your video helps me so so so much!!! Thank you for all your efforts
Glad to help you Ayush!
v.good explanation 👍👍
Thanks!
Tq sir bhut aache sai smjh aagya easy way m
Good👍
Even Iam Tamilan I can able to understand easily sir...U coveys the content very clearly💥🫂
Sir you saved my concepts!! #ThankYou
you are really great 🔥
gurudev aapki jai ho🙏🙏🙏
😊🙏
❤️
def fibonacci(n):
if n
Hats off to your efforts in such time ,,
:)
you are right shukla g
Thanks sir in this situation u are giving ur best for us ........ take care sir......🙂👍
So nice of you Uday!
loved it!! cristal clear now
😊👍
Thank uh so much sir bht acche se explain kiya hai apne
Thanks & most welcome Kashish!
11 channel ki video dekhne ke baad, call stack me ulajhne ke baad, अब कहीं जाकर समझ आया है 😅❤
much helpfull.. thank you sir
Glad to help you😊
Thanks, very nice explanation
Thanks & most welcome Saurabh!
all video are very Good Teacher Thanks
Always welcome Badal!
NICE SUPER EXCELLENT MOTIVATED
Thanks😊
Nice 👍👍👍🎉
great sir
This video is so helpful 👍☺️ sir
My pleasure😊
Thank so much sir for this amazing concept......
Thanks & most welcome Navendra!
Keep going sir! You are doing great 😊😊
Thanks a lot Rinki!
Thanks sir part (4) ke liya
Most welcome, Part 5 to come soon !
Tq sir, for a clear explanation
Thanks for wonderful explanation sir 🙏
Thanks & most welcome Manisha!
Thank u soo much sir ...❤️✨
Most welcome !
Thanks a lot...
Gjab sir
Very well explained
Thanks for liking!
Nicely explained
Thanks Nitasha!
made easy for me !
😊
Amazing explanation....
Glad you liked it Krishan !
Osm sir sir PHP bhi pda do sir
Sir ek question tha ki jab fibo (3)+fibo (2) call hota hai function kai ander toh woo def fibo (n) kai pass jaiga as per recursion rule lekin wo return print (fibo (i)) kai kyu jra hai sir thoda sa doubt app clear krdai toh acha rheta
Recursion ka way hi yahi hota hai ki wo baar baar call hota hai jab tak ki base case na mile.
Sir need a tutorial video on Oops in python 🙏
Thank you soooo muchhh
Most welcome Shafaq!
sir 1 doubt ... iss program mein function ko toh loop ke zariye baar baar call kiya ja raha hai par recursion mein toh function ke andar hi function ko call karte hain na ?
Amod, when n is 1 or 2 for that case only we have to call using loop for all other stages, we are using the concept of recursion.
Thanks sir 🤗
Most welcome Pankaj!
def fibonacci(n):
if n
Sir, I have run this program but not able to get the desired series .please look into this . Also cross checked many times
Wow♥️♥️♥️
🙂
Very Great Sumit! You are like (beef/meat) in biryani without it there's no feeling of joy in eating.
May I know is there paid tutorial for python in which you are teaching?
Sumit???🤔
Excellent . Solid explanation.
sir i tried this in idle and after printing 0 1 it reflects RecursionError: maximum recursion depth exceeded in comparison
plz help me to fix it
Please paste your code here.
sir but in fibonacci series term starts from 0 like 0th term, 1st term ..... example - in your case if n = 4 then 4th term is 2 but sir I have checked and found that at n = 4 then 4th term is 3 like term starts from 0th term , 1st term.... plz clarify this.
def recur_fibo(n):
if n
There is a no reply of my question. Or doubt
thank u sir
Most welcome Dhiraj!
Best
Thanks!
sir what changes to make for tribonacci series
this one also helped thank u 😊
Please try out by yourself. If you won't be able, I will make a video on it.
Sir, i did this programming and the same issue is coming that it has been reached its max. Linit
Bro program ko final call kaha karien ge?
Sir iss program me apne *else* kyu nhi lagaya hai ??
Nice
Thanks Ajeet !
nyc sir
Thanks !
Give notification
can anyone tell me the best chemistry and maths teacher on utube
All pls suggest him !
you forgot to use else for 3rd return . Just mention that and pin in comments so other dont getit wrong in exams
Increase the frequency of uploading videos
Don't worry, I will finish the course by January.
@@codeitup okay sir..plz cover all the chapters of sumita arora
@@shraddhamall4938 Sure !
@@shraddhamall4938 Sure Shraddha
Hi Shraddha i am lucky singh
Sir n+1 kyu liye nhi samjha
💚💚💚💚
🙂
👍👍
👍
♥️♥️♥️♥️♥️..
....
....
♥️
concept good but this code not working on python.
sir plz thoda jlde video upload kijiye
I am trying to upload Bipul. Along with this I am also uploading SQL Videos.
Sir sum of n natural numbers se v ans same hee aa rha hai 👁️👄👁️
sorry sir but may be
your code is not working after print 0 and 1
My grandma is asking me if you'll take fees for teaching us on youtube
sir o/p 0 1 2 4 aisa aa rha
it showing wrong answer
Abae Pura program galath hai
So pahli baat, aapko tamij honi chahie ki aap ek teacher se baat kar rahe ho.
Dusari baat program bilkul sahi hai, kuch bhi comment karne se pahle use jarur check kar liya jaata hai, kuch bhi jo mann me aae bol nahi dete hai...
def fibo(n):
if(n==1):
return 0
if(n==2):
return 1
return(fibo(n-1)+fibo(n-2))
n=int(input("Enter Number of Terms:"))
for i in range(1,n+1):
print(fibo(i))
Thank you sir😊🙏
Most welcome😊
Thank you so much sir
Most welcome😊
Thank you sir
Most welcome 😊
Thanks sirr
Welcome!
Sir iss program me apne *else* kyu nhi lagaya hai ??
Sir sum of n natural numbers se v ans same hee aa rha hai 👁️👄👁️
Thank you❤sir
Thankyou so much sir
Most welcome Khushi!
Thankyou sir
Most welcome Anand!
Sir iss program me apne *else* kyu nhi lagaya hai ??