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

preview_player
Показать описание
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!


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)

Sigma Batch:- Full-Stack-Web-Development (MERN Stack)

Impact Batch:- Data-Science-Masters (Full Stack Data Science)

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

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
Рекомендации по теме
Комментарии
Автор

📗 Enroll Now in Decode Batches and become JOB READY:

CollegeWallahbyPW
Автор

This is the best C programming playlist I've ever watched on I'am doing it consistently everyday
Thanks Sir

Lucky-swbv
Автор

I never commented on YouTube...dis s my first comment ...I'm using YouTube for years for my studies...i felt dis s d best playlist to learn c programming....n u r so amazing at teaching sir

doll
Автор

Father class on C programming on whole YouTube 👌👌🔥

aman.mishra
Автор

you are the best sir. maine sare famous channels dekhe c programming ap hi ho jinse mujhe c programing ka pura knowledge mila

arinditagoswami
Автор

i hv studied from many resources but this is the best, raghav sir is the best, the way of teaching is the best, each and every point is the best, questions are the best, sir's efforts are the level understanding thankyou sir maja aa gya and lv u. please make videoes on dsa of c language

aakashnasir
Автор

2:17:38 that is what your lectures attract students so much.. ❤

sameerkumar
Автор

Sir is also revising the concept of loops along with recursion is just great.

shachisinghal
Автор

Thank you Raghav gurudevjee!! Your teaching skills are awesome. Hats off and big thank you.

torishi
Автор

Sir you are best teacher of C programming language …. I don’t have words for appreciating you 😅
But… one day i will definitely give you gurudakshina and make you proud 😊❤

Perfectionist
Автор

"tower of hanoi" very awesome MOJA AAGYA .... and raghav sir you are great
your teaching style and understanding steps awesome i think anybody can understand very your lecture
YOU ARE LIKE GOD RAGHAV SIR

pratyushpradhan
Автор

so far, I have enjoyed learning recursion. College mei kya padhate hai kuch samajta nhi.. Raghav sir is the best !

mahekjoshi
Автор

i think this was the best conceptual lecture till now with the best practical applications.

jayagrawal
Автор

Thank you sir For This Tough Topic "Recursion" ❤️👍

DilipKumar-yvut
Автор

Thank you sir, this recursion topic is very amazing

sanjnasahu
Автор

Sir i solve the maze problem with this function -> int maze(int a, int b){
if(a==1||b==1) return 1;
return maze(a-1, b)+maze(a, b-1);
}

savvy
Автор

Thank you sir🥺
It was an amazing session!!!

naziyabegum
Автор

Tower of Hanoi me mja aa gya sir ji...What a brilliant, outstanding and awesome lecture 🤩🥳

DevenderSingh-zjbt
Автор

[6].I have seen this lecture today. And you explain any concept in easy language, sir.
4th October 2023

NirajKumarPandey
Автор

Beautiful lecture and gorgeous teaching skill..

YangyangJohn