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

[@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😂😂

[@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

[@aaryanmehta981]

Can you give practice uestions after every lecture

[@iSubhoo]

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

[@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

[@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

[@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

[@khatariinsaan5284]

7:55 what a clear Explanation

[@tcoa79_rajdange62]

Legendary 😃

[@30vaibhavdhaygondexdr.v.sa22]

3:06 ----> this is correct

[@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

[@indrocky6530]

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

[@rajanijaiswal333]

Awesome video Question of 03:00 yess

[@Ishika-n9g]

11:42 if(n

[@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

[@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

[@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 ❤

[@nishtha9666]

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

[@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 😂😂

[@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

[@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

[@royfamily9273]

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

[@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

[@HiTech1203]

You have made my coding life easy

[@karanbisht-k6k]

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

[@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

[@kiranshinde03]

3:08 yes Harry Bhai we can write.

[@akashwaghmare7221]

You are the most intelligent programmer in the India

[@satyamsharma8371]

Superb... 👍👍👍

[@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!

[@kunalkumar6783]

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

[@kumkumbhagya51]

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

[@pikachugaming3371]

You are same like my sir very understanding

[@syeduzairmohiuddin5514]

👍👍👏Excellent explanation.

[@abuhuraira5293]

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

[@kumkumbhagya51]

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

[@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

[@nishumittal4277]

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

[@vijaysurve4700]

Teaching method is awesome👍👏

[@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

[@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.

[@SamarthChawlaSam]

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

[@harshitjain2081]

2:55 Yes it is factorial

[@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

[@iSubhoo]

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

[@harshhitgupta4434]

bilkul sahi baat hogi

[@sea604]

सही बात है।

[@MayureshYadav-xf1ii]

Thank you so much sir

[@gameforall_official]

It will be If(n

[@zebra-er6xc]

yes you are correct

[@studytostudy5919]

Ha likh sakte hai 😀👍🏻....

[@gaganagrawal8194]

Sir please provide practice questions also

[@Rizwankhan-dh5xh]

make a complete course on data structure and algorithum please sir

[@BlackScreenProductions]

Write a C ++ Program. We have a day-to-day record of USD price in PKR for last 100 weeks. Find the week, which has a highest variation in PKR, while a base price is 160Rs = 1 USD. Also, find which week has the highest average USDprice Sir Please Solve The Problem

[@PraveenKumar-rg6xs]

Question mein to logic hain wahh

[@satyamkarn3277]

3:07 yes you can write.

[@hopes_alive-100]

3:06 yes! likh sakte hai

[@manavroy7293]

3:06 Yes.

[@akashwaghmare7221]

Your teaching is awesome

[@DaniyalSaqib-my1us]

Recursion is just a function calling itself inside itself

[@khizrshaikh9902]

2:46 Yes It is correct ye baat sahi hongi

[@engineeringlife4567]

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

[@rashidhashmi6181]

yes u can it as factorial✅

[@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

[@chaolobi7698]

thanks harry bro

[@jaydeepsatani6878]

yes likh sakte hai

[@alnahian8051]

3:08 yes it can be written

[@papaajanpapa4281]

Yes true Hogi n!

[@codingislit1404]

Thanks bhaiya

[@AdityaGupta-cz7wp]

recursion function is also known as aatmnirbhar function

[@rohitashwapratapsingh142]

oooo

[@tayyab.sheikh]

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

[@newsend257]

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

[@saadhassan8813]

good teacher

[@chinmaykhairnar6750]

Yes we can write 3:07

[@XengShi]

# same function in python def factorial(x): if x

[@prashantmajumdar1519]

But very slow as compared to cpp if you run it it will take 5-7 sec but in cpp even more lines of code will run under 2 sec

[@dhananjayjadhav7064]

But code is wrong💯💯

[@sanatandharmyogicculture700]

Teaching method is awesome

[@109_ritikahasija5]

Bhaiya agar hum fibonacci function ko inline banate to kya hota?

[@Lifeinspiration7777]

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

[@abhishekchoudhary1204]

yes we can

[@gurpreetsingh-jh3bk]

thank you sir

[@chiragwadhwa7909]

2:55 correct

[@angshumandasgupta4857]

yes you are right

[@varshithkumark8993]

12:57 for n

[@heeru379]

return fib(n-2) + fib(n-1); Jab me input *2* dunga to (2-2) + (2-1) 0 + 1 = 1 *1* return ho chahiye na. To fir *2* kyun return ho rha hain? 🤔

[@sahil2917]

fib(0) + fib(1)= 1 + 1 = 2

[@suryakumararun5761]

Fib(n-2) ≠ (n-2)

[@aniketraj269]

3:06 Bilkul hoga bhaiya

[@sagar_wani]

Thank Harry 😊

[@mr_amit_shelke]

3:11 Yes, Ofcourse

[@techahsan1873]

yes likh sakty hain (n-1)

[@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.

[@kundanpatidar9207]

Love these content

[@Sousa2255]

3:05 Obviously sir

[@Ajaykumar-nj5yz]

सर, आपसे एक सवाल था कि अगर में python series के साथ C++ की series भी साथ में लेकर चलू तो क्या ये, ठीक रहेगा, क्योंकि कुछ लोग बोलते है, कि C++ python से कठिन है सिखना।

[@Souravkumar-iw7gy]

ek samay pe ek language sikhna behtar hai, aur python aur c++ ke syntax bilkul alag hai

[@Ajaykumar-nj5yz]

@@Souravkumar-iw7gy pr mera mind bolra h ki C++ ke basics bhi saath lekr chalu taaki kb advanced pe aau to koi prblm na ho

[@prathameshsuryawanshi5017]

@@Ajaykumar-nj5yz concepts to lagbugh same hi hai sirf syntax different hai

[@shumailabatool7493]

Yes we can write n*(n-1)!

[@thegyaan7535]

Yes u can

[@piyushjat5213]

I don't know programming very well but I know maths very well and according to me for example if we put 5=n then fib(5-2)=3+fib(5-1)=4 and putting 4 and 3 together we get 7 not 8 please tell me who's wrong the program or my maths

[@gauravgharmalkar1727]

Ur math is wrong fib(5-2)=fib(3) hota hai 3 nahi hota..waha fib(3) ki value 2 ayegi

[@crazygirls2862]

Maths galat jagah se padh rahe ho. Tuition change karo

[@sajidamehrosh505]

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

[@MrUKD4444]

yes ❤

[@07670]

Your way of teaching is really awesome . But I have one request can u plz written program separately , sometime it's confusing and irritating too...

[@yeshwanthyesh6939]

yeah even I felt the same

[@saqlainali8401]

You are the best

[@pratyushkurhe1577]

3:07 yes we can

[@mansigupta2824]

3:07 yess

[@ashitranjan3971]

Well enjoying the tutorial

[@dhruvpatel1014]

yes