Recursions & Recursive Functions in C++ | C++ Tutorials for Beginners #18

[@harmankaur3938]

//Author:Harman kaur //purpose:fibonacii series #include using namespace std; int fib(int n) { if (n < 2) { return 1; } else { return fib(n - 1) + fib(n - 2); } } int main() { int num; cout num; cout

[@Bloodflood]

what will be the iterative approach he is mentioning is it with the help of loops

[@saeedahmedjamali7235]

Thank you! Needed this for an assignment

[@GeekyShubhamSharma]

N(N-1)! = Katai jahar concept bilkul sahi paaji😂😁 dedo ♥️♥️♥️♥️♥️♥️

[@nirmalbuoy]

12th maths padhi hoti toh tujhe zeher nhi lagta ekdum basic hai ye

[@palashagrawal2343]

@@nirmalbuoy 11th maths be

[@nirmalbuoy]

@@palashagrawal2343 Ha wahi jo bhi hai, hume JEE coaching ke waqt aisa kuch 11th 12th nahi padhaya tha isiliye pata nahi kaunse class me aata hai

[@crazygirls2862]

11th maths Padhi nahi hai aapne bca wale ho na

[@iamFJ18]

Halwa hai😂😂

[@iSubhoo]

Sir, jab samajh me awajata hay, to video ending song bohat acha lagtahay.

[@khatariinsaan5284]

7:55 what a clear Explanation

[@tcoa79_rajdange62]

Legendary 😃

[@aaryanmehta981]

Can you give practice uestions after every lecture

[@AnEngineerHuman]

Loving this playlist. Day-12 Completed upto Tutorial-18 Date-14/12/2022 Time-19:32 Topic-Recursions and Recursive Functions

[@sayman099]

bro are u from cs / it branch?

[@AnEngineerHuman]

@@sayman099 yes bro,i am from it branch.

[@pratikingle3963]

@@AnEngineerHuman CPP DONE???

[@pratikingle3963]

@@sayman099 TUM KONSE BRANCH SE HOO??

[@AnEngineerHuman]

@@pratikingle3963 ha ,keh sakte ho .Par jada practise nahi hui... Thanks for reminding me

[@rudranshsharma114]

Giving some question that You can practice 1)Write a program which displays the largest among 2 No. 2)Write a program which displays grade on basis of marks 3)Find the roots of quadratic equation 4) To find year enter by user is a leap year or not 5)To find operation of 2 No. enter by the user by (Switch) method{+,-,*,%,/)etc. 6)To find operation of 2 No. enter by the user by (if else ladder) method 7) using goto feature create a multiplicative table 8)Sum of digit of integer enter by user by (goto) statement{EX- 76 = 13} 9) Sum of n natural numbers using (for) statement 10)To Find factors of No. enter by user 11)To find to Reverse of Digit 12)To state whether no. enter is Penedrom or not 13)To find No. is prime or composite Agar inke code cheye to message me . Please Pin this student ki help hogi bhot isse ache questions hain

[@arnavmaheshwari6149]

I realized something that all the people who are watching this to learn c++ are building there programming style a lot similar to harry bhai's

[@apmotivationakashparmar722]

fib(5)=fib(4) + fib(3) = fib(2) + fib(3) + fib(2) + fib(1) should in place of fib(2) + fib(3) + fib(2) + fib(3).

[@rohitashwapratapsingh142]

yes

[@anju7334]

Ye chij mujhe samaj ni aayi ki Harry bro ne kaise toda Could you pleas explain me?

[@apmotivationakashparmar722]

fib(n) = fib(n-1) + fib(n-2) apply this .

[@anju7334]

@@apmotivationakashparmar722 n = 5 so fib(5) = fib(4) + fib(3) ho gya But iske bad ye dubara se jab run hoga to fib(4) ke liye fib(4-2) = fib(2) Fib(4-1) = fib(3) And fib(3) ke lye fib (3-1) = fib(2) Fib(3-2) = fib(1) Banega but lecture me fib(1) to kahi hai hi nhi

[@anupamdatta6584]

​@@anju7334 Jab fib(1) meh jayega toh value toh 1 return karega kyuki n

[@Abhishek-dp5tc]

competitive programming pe series bana bhai, Please!

[@SK-gp6cm]

Do you find cp series???

[@Abhishek-dp5tc]

@@SK-gp6cm wow 2 years back Yes many series are there, I also bought a course on udemy but it is more of DSA focused rather than cp

[@SK-gp6cm]

@@Abhishek-dp5tc can you share that link

[@Ramneet04]

Bro where can i practice question or should i practice question or first complete whole series of c++ here

[@gulshansingh7961]

@@Ramneet04 first complete this series

[@rajanijaiswal333]

Awesome video Question of 03:00 yess

[@30vaibhavdhaygondexdr.v.sa22]

3:06 ----> this is correct

[@nishtha9666]

Ur explanation is Just amazing👍👍👍👍👍The Best

[@b10gaming2]

I can't even imagine a world without stack overflow and codewithharry!

[@seasonalmind7241]

can u tell me how 2 returned in fibbonacci at 3?

[@desiquant]

@@seasonalmind7241 f(3) = f(2)+f(1) = [f(1)+f(0)] + f(1) = f(0) + 2 f(1) = 1 + 2(1) = 1+2 = 3. Makes sense?

[@seasonalmind7241]

@@desiquant yeah it definitely does.Thanks.

[@unknownsuperstarmanish7013]

increase u r imagination

[@bhuwannath61]

2:52 n! = n*(n-1)! It is correct . Let we take example : Factorial of 5 = 5×4x3x2x1 . Instead of multiplying like above we should first calculate factorial of 4 and then multiply it with 5 . Now we get factorial of 5.

[@programinglife.1400]

Hme bhi ata hai

[@nitishkr75]

@@programinglife.1400 😂😂

[@yashodharpatel6594]

We can also do this by using Array, It decreases the execution time. 1. Factorial : int fact(int n){ int a[100]; a[0] = 0, a[1] = 1, a[2] = 2; for(int i = 3;i

[@ayushparmar7729]

bhaiya is factorial wale tarike se aur harry bhaiya ke tarike se bhi 20! ka ans nhi aa rha ans negative m de deta h koi solution is ko solve krne ka for greater integer values

[@kartikbisht1909]

@@ayushparmar7729 20 ka factorial?

[@kartikbisht1909]

@@ayushparmar7729 bhai 20 ka factorial itna badha hota h ki int mi nhi aa sakta kyuki int ki range -2147483648 to 2147483647 hoti h aur iska factorial quadrillion mei h

[@ayushparmar7729]

@@kartikbisht1909 bhai vo to ho gya tha jo bhi digit calculate krke aa rhi h use array m store krte joa aur pos pointer ko +1 krte jao

[@kartikbisht1909]

@@ayushparmar7729 ook

[@satyamsharma8371]

Superb... 👍👍👍

[@Ishika-n9g]

11:42 if(n

[@indrocky6530]

In the fib function, the base case returns 1 for n

[@kiranshinde03]

3:08 yes Harry Bhai we can write.

[@syeduzairmohiuddin5514]

👍👍👏Excellent explanation.

[@chaolobi7698]

thanks harry bro

[@karanbisht-k6k]

Iterative approach for fibonacci. #include using namespace std; void fibonacci(int n){ int a =0; int b=1; int sum =0; cout

[@AbhrajyotiDas-l7h]

While calculating the factorial of very big number, we get zero since computers try to give the answer in exponential form. So, to get the actual result, change the data type of the function to double to get the exact value. Hope this helps!

[@AnushkaPandey-h2c]

Actually, I wanted to calculate the factorial of 100 but it gave 0 as an answer...I was confused. But because of your advice, I changed int to double and I got the correct answer. Thank You!

[@AbhrajyotiDas-l7h]

@@AnushkaPandey-h2c Happy to know that the solution I gave, helped somebody :) ! This made my day :)

[@Sports-im6yv]

Bhai datatype long used karke dekh

[@bansilalnabediya3501]

​@@Sports-im6yveven better long double😊

[@Sports-im6yv]

@@bansilalnabediya3501 thanks bhai ❤

[@HiTech1203]

You have made my coding life easy

[@akashwaghmare7221]

You are the most intelligent programmer in the India

[@AbcD-ju9un]

JazakAllah sir Ameen.

[@vijaysurve4700]

Teaching method is awesome👍👏

[@royfamily9273]

Yes, n!=n*(n-1)!. Thanks Harry Bhaiya

[@saqlainali8401]

Wasa ap boht amazing ho sar manna padaga he is so amazing apki explanation to ItnA excellent ha ka na bhi samajh aya to ap samjha hi data han ItnA àcha aj tak mujha kisii na koi topic nhi samjhaya you are the best for explained every topic thank you so much sir thanks

[@pikachugaming3371]

You are same like my sir very understanding

[@YashPatil-t8c]

If a = 5, the program calculates the fifth term in the Fibonacci sequence using the recursive calls: fibonacci(5) is called. Since a > 2, it goes to fibonacci(5) = fibonacci(3) + fibonacci(4). To solve fibonacci(3), it breaks down further: fibonacci(3) = fibonacci(1) + fibonacci(2). Both fibonacci(1) and fibonacci(2) return 1, so fibonacci(3) = 1 + 1 = 2. Meanwhile, for fibonacci(4): fibonacci(4) = fibonacci(2) + fibonacci(3). fibonacci(2) returns 1. fibonacci(3), as calculated earlier, is 2. Thus, fibonacci(4) = 1 + 2 = 3. Now, substituting back, fibonacci(5) = fibonacci(3) + fibonacci(4) = 2 + 3 = 5.

[@AhmadJamil-kk1on]

Yes you can Because if you take 7 as n then n-1 will be 6, when we take the fictorial of 6 then absolutely get the desired ans

[@harshitjain2081]

2:55 Yes it is factorial

[@abuhuraira5293]

recursions means a function is calling itself on its own until it gets the answer

[@akshanshkaushal9422]

16:00 It should be like this. Fib(3)= Fib(2)+Fib(1)...correct me if I'm wrong.

[@janakkore1597]

I think you are right since I was searching for this comment as well

[@kumkumbhagya51]

2:51 sahi hoga kyuki yahi formula hai factorial nikaalne ka

[@anees_05]

fib(5) // fib(4) + fib(3) // fib(2) + fib(3) + fib(2) + fib(3) harry bhai ap ne is mai ghalti krdi hai mai tou cinfused hogaya tha pehle ab clear hogaya

[@satyamkarn3277]

3:07 yes you can write.

[@akashwaghmare7221]

Your teaching is awesome

[@khizrshaikh9902]

2:46 Yes It is correct ye baat sahi hongi

[@fellincode2607]

finally mere ko recursion samajh me aagaya mene java playlist me ek baar video dekha to mere ko utna samajh me nahi mene dusri baar dekhna ka socha procasination hoto gayi!

[@MayureshYadav-xf1ii]

Thank you so much sir

[@atifmalik8012]

#include using namespace std; int factorial(int n){ if(n==0||n==1){ return 1; } else{ return n*factorial(n-1); } } int main(){ int n; cout

[@gaganagrawal8194]

Sir please provide practice questions also

[@anshitshukla7498]

Data structures aur algorithm pe playlist 🙏🙏🙏🙏

[@nikhilraj1842]

go to geeksforgeeks until codewithharry sir upload Data structures and algorithms

[@anshitshukla7498]

@@nikhilraj1842 thanks

[@niteshbovi769]

@@nikhilraj1842 can u plz tell me the roadmap for programming language with dsa

[@nikhilraj1842]

@@niteshbovi769 well i am not a professional in this topic as I learned which i like to do in dsa like question solving and I Don't follow a roadmap. So i can't give you roadmap for this.

[@alnahian8051]

3:08 yes it can be written

[@kunalkumar6783]

IN last 16:30 - I will see you next time...... BGM(totally incredible)

[@sagar_wani]

Thank Harry 😊

[@kundanpatidar9207]

Love these content

[@sanatandharmyogicculture700]

Teaching method is awesome

[@chiragparmar1964]

I really love all of your videos BUT please change your chrome browser theme to DARK MODE because when you switch from vs code to chrome browser it hurt my eyes badly because we are so focused on your video and suddenly going from black screen to white screen really hurt eye cornea and I cant tolerate that feeling anymore please take this note on a serious measure...btw love your teaching style and keep it on!

[@rashidhashmi6181]

yes u can it as factorial✅

[@deepikasoni4833]

Thankyou so much sir🙏🏻😁

[@tayyab.sheikh]

Now i understand kay India ka har bacha coder kyuon hai.

[@nishumittal4277]

yes, we write n*(n-1) to the n!

[@riddhimapradhan84]

Well explained🙌🙌

[@laxman2919]

HARRY NAAM SE HARRY POTTER SMJHE KYA , PRO CODER H ME 😍😍😍💥💥💥💥💥💥

[@gurpreetsingh-jh3bk]

thank you sir

[@studytostudy5919]

Ha likh sakte hai 😀👍🏻....

[@SamarthChawlaSam]

1:32 6! = 720 2:52 Sahi hogi

[@SouravBiswal-hh5iw]

Yes thk haie..❤

[@usefullyuseless4404]

i want to call you and will say that... HAA BHAI ACCESSS KARLI HAI PLAYLIST!!!!! KARLI HAIIIIII !!!!!!!!!!!!!!

[@hitsong5606]

sani bat hai

[@iSubhoo]

Yes Sir, n! = n * (n-1)!

[@ashitranjan3971]

Well enjoying the tutorial

[@codingislit1404]

Thanks bhaiya

[@sajidamehrosh505]

Sir you make programing easy for me really thank you SSO much.....

[@AbhishekKumar-id3yz]

Fibonacci Series 0 se start hota hai. 12:46 par n sahi tha. Aapne 1 kar diya anways bade bade sahro me chotti chotti baat hote rahti hai

[@jawadmalik6832]

we can also find factorial using static as in previous video.

[@DhvanitMonpara]

How? I tried but it isn't possible without recursion or looping.

[@muhammadareebkazmi9476]

Thank you, Harry bhai!

[@kumkumbhagya51]

bro pls practice set bana do us se aur bhi zyada confidence aa jaata hai jab saare questions complete krleta hu

[@varshithkumark983]

12:57 for n

[@MrUKD4444]

yes ❤

[@harkishannarola4223]

#include using namespace std; int work(int n){ if(n>=30){ return n = 3; } else if(n>=15){ return n = 4; } else if(n>=10){ return n = 5; } else if(n>=5){ return n = 6; } return n = 8; } int main(){ int a; cout

[@manavroy7293]

3:06 Yes.

[@mr_amit_shelke]

3:11 Yes, Ofcourse

[@hibbonix9530]

Muje bohot achhe se samj aa gaya thank you sir 😭😭😭

[@satyaanand9243]

toh ro kyu rahe ho?

[@hibbonix9530]

@@satyaanand9243 hay tum bhi dsa sikh rahe ho kay?? Please reply karna

[@Rizwankhan-dh5xh]

make a complete course on data structure and algorithum please sir

[@anonymousgerman2809]

Thankyou harry bhai

[@VoyagerDevSharma]

Definitely sir we can write it

[@DaniyalSaqib-my1us]

Recursion is just a function calling itself inside itself

[@cheryrj8305]

thnk u soo much for this, its really helpful for me

[@angshumandasgupta4857]

yes you are right

[@srijansoni6972]

Completed ✅❣️🔥

[@Lifeinspiration7777]

recursion means function call itself again an again until result is found

[@mansipansuriya5917]

true hai

[@saqlainali8401]

You are the best

[@internetenjoyer9186]

For calculation nth term we can use a+(n-1)d, where a is 1st term and d is common difference

[@ananyasingh774]

that's for constant series, but here the common difference is changing

[@Life.Z1]

Ha..it is the staple equation where the difference is fixed

[@hopes_alive-100]

3:06 yes! likh sakte hai

[@maheshkumarpatel5790]

yes n*(n-1) is true!!

[@saadhassan8813]

good teacher

[@runwithrahul]

#include using namespace std; int fib(int n){ if (n

[@newsend257]

time 2:53 Yes , ture , n! = n * ( n -1)

[@abhijitsingh855]

Thanxxx bhaiya...it helped a lot...😇

[@Sousa2255]

3:05 Obviously sir

[@hassaandzigns]

gg Sir bilkul Likh skty hain

[@maygirl4086]

yes we can write it tthat way

[@HarshRaj-pi4om]

bhaiya thanku for your help!

[@engineeringlife4567]

Sir , ye video enough h ya fir particle exercise bhi karni padegi