Recursion in One Shot | C Programming | Lecture 6 | Complete C Course

In this video, Raghav Sir will teach you about RECURSION in DETAIL. This is Lecture 6 of the C Programming series. Topics covered are - recurrence relation, tree diagram, recursion after call, multiple calls, euler tour tree, call stack and LOTS of questions. ARRAYS will be covered in the next Lecture in detail, coming SOON.

So what are we waiting for?
Let us meet in the class!

Lecture Notes :- http://bit.ly/3WFlbsl

If you are facing any trouble accessing the assignment or lesson plan, please re-login to your account on PW Skills website and try.

Are you finding the classes helpful?
Stay tuned for more!


PW Skills is announcing the launch of the following programs,

Binary Batch:- Java-with-DSA-&-System-Design (Java with DSA & System Design)
https://pwskills.com/course/Java-with... (Hindi)
https://pwskills.com/course/Java-with... (English)

Sigma Batch:- Full-Stack-Web-Development (MERN Stack)
https://pwskills.com/course/Full-Stac... (Hindi)
https://pwskills.com/course/Full-Stac... (English)

Impact Batch:- Data-Science-Masters (Full Stack Data Science)
https://pwskills.com/course/Data-Scie... (Hindi)
https://pwskills.com/course/Data-Scie... (English)



Website - https://pwskills.com/

Instagram -   / pwcollegewallah  

LinkedIn -   / ineuron-ai  
  / physicswallah  

Telegram - https://t.me/SkillsPW

Discord -   / discord  

Twitter -   / pw__skills  

Access the notes and assignments for this class for free at : ▶️https://pwskills.com/course/Cracking-...

If you are joining us late, to know more about PWSkills & plans :

Watch the Orientation Video:    • C++ DSA and Java DSA - Orientation Se...  
Watch the Launch Video:    • @CollegeWallahbyPW THIS REVOLUTION WO...  

TIME STAMPS:
00:00 Introduction
03:59 Recurrence Relation
09:41 Function calling itself
15:15 Prob 1 : Factorial of a number
25:33 COMPREHENSIVE DRY RUN
30:06 Tree Diagram
33:18 Prob 2 : Print ‘n’ to ‘1’
46:56 Prob 3 : Print ‘1’ to ‘n’ (Extra Parameter)
55:59 Prob 4 : Print ‘1’ to ‘n’ (After Call)
1:05:00 HW 1 : Print Decreasing - Increasing
1:06:34 Prob 5 : Print the sum of ‘1’ to ‘n’ (Parameterised)
1:18:54 Prob 6 : Print the sum of ‘1’ to ‘n’ (Return Type)
1:22:05 Prob 7 : Print ‘a’ raised to the power ‘b’ (Linear Approach)
1:29:24 Prob 8 : Print the ‘nth’ fibonacci number
1:43:16 Euler Tour Tree (basic)
1:46:00 *Prob 9 : Stair Path (2 Jumps max)
2:00:55 HW 2 : Stair Path (3 Jumps max)
2:03:45 *Prob 10 : Print ‘a’ raised to the power ‘b’ (Logarithmic Approach)
2:31:51 *Prob 11 : Maze Path (4 parameters)
3:03:53 Prob 12 : Maze Path (2 parameters)
3:11:14 Call Stack (basic)
3:13:23 **Pre - In - Post
3:33:04 Prob 13 - Print ZigZag
3:37:05 **Prob 14 - Tower of HANOI (Best Explanation Ever)
4:16:16 Maza aa gaya na? To likh do comments me.

#CProgramming #RecursionOneShot #CCourse #CompleteCTutorial #CLecture6 #ProgrammingBasics #LearnCProgrammingOneShot #CTutorial #PWSkills #Recursion #CollegeWallah #PhysicsWallah