Types of Recursion (Part 1) | Direct & Indirect Recursion

[@AJewFR0]

This is high quality for a KZbin channel on CS. Great Job from the US.

[@hetaeramancer]

@@sohamshinde1258 he said he's from the US

[@sayantanmondal8630]

All are INDIANS

[@Ppu_for_a_reason10yrs]

​@@hetaeramancer 😂 he wasted his time on Duolingo.✅

[@HosBarGamers]

I have never found such a channel that is so good at explaining CS stuff. Great job.

[@aradhanasoni6616]

I've never seen any sir as you explain about C language. You're the God of C. Love you sir 😍

[@RiseWithShivam]

Ya, He is God of C😍😍

[@name-iq7on]

Bro where were you this whole timeeeeee,,, is your words are magic or what ,, why am getting your explantion straight in my brain ,,, seriously bro u made my thinking better ,,, where so many were eating my brain, also i m in love with your explanation, the way u r explaning is incredible.

[@saifulislamsarfaraz]

one day there will be billions of viewers in your tutorial

[@sarfaraz6582]

it should be but people ain't too much interested in studying unlikely they are busy unnecessary drama..

[@Dnsx_plus]

@@sarfaraz6582 You got a girlfriend?

[@fortnitelove8129]

Don't waste time in bf or gf or any other human being, invest only on YOU

[@Dnsx_plus]

@@fortnitelove8129 yeah forreal

[@hetaeramancer]

not really billions, but several millions!

[@MrTomro]

Amazing, I like the stack diagram, helps u visualize the whole process

[@sanjaykarthicks1226]

I really like NESO ACADEMY ❤️ It's really effective for me while preparing for my C paper in sem2 Thank you so much sir for your lectures

[@surbhitamrakar1638]

Thank you so much sir for this series.I found recursion very hard before I watched your lectures..but now I am comfortable with recursion. Thanks alott.

[@matematleta492]

Best explanation of this material on YT. Thank you!

[@piyushji2312]

One of the best online playlist to learn recursion . Sir please if you could make a series on backtracking and dynamic programming as well. _/\_

[@FarhanAli-gd2qv]

I totally agree with you.

[@enjoylearning210]

Background music at last really motivates me 😊😊 and indulge myself in that thought ..I have achieved something , it's just becoz of ur awesome video series ...really best 👍 . Not so long and not so short , perfect one

[@yusraabdullah8261]

Now I subscribe your channel for giving us a beautiful example of indirect recursion..... Very beautifully explained...... Now my concepts are clear ❤️Thanks sir..... You deserve millions likes.... And you'll get soon

[@accessdenied9393]

Example in same factorial function indirectly: [Fact() can calc the factorial of at least 20 and -20, if you calc fact(21) or fact(-21), this will exceeds the range of long integers, and thus you ended up with wrong results] long Fact(int a) { if (a > 0) return posFact(a); else if (a < 0) return negFact(a); else return 1; } long posFact(int a) { if(a == 1) return a; else return a * Fact(a-1); } long negFact(int a) { if(a == -1) return a; else return -a * Fact(a+1); }

[@kesavae9552]

Mission accomplished, respect++

[@anchalagrawal4332]

Sir you explained it very well . nobody can explain like this 👌👌👌👌

[@bruhmetsaiharnet6595]

Thank you,God bless you

[@pariminagalakshmi5517]

sir,thank you soo much .... these videos are very helpful for many students like me.. once again thank you soo much sir...

[@mani_vk_29]

Answer for homework problem is 15. Thank you

[@Adityasharma-oe8zp]

I've done the same question like this Int a=1; Void main() { Void fun(int); If (a>10) Return; If(a%2!=0) Printf(" %d",a+1); Else fun(a); a++; main(); } void fun(int b) { printf(" %d",b-1); a++; main(); }

[@hetaeramancer]

what's the output?

[@Adityasharma-oe8zp]

@@hetaeramancer output is same as in the question.... I've tested it after that i posted it

[@batsmanist]

Thank you for this class. It opened my mind to a hard task I was doing.

[@MorrowSind]

Nice and very well explained.

[@rileshkhatri1209]

Since we are using tail recursion here with void function we don't really need the return statement.We will still get the same output even without a return statement

[@sujoymollick1239]

Amazing. Go on.

[@manoharsinghrawat1859]

Very awesome lectures 👌

[@zeshanmushtaq5295]

Love from Pakistan thanks too much sir g

[@rizwanriaz7595]

Excellent

[@sajadulislamdipu1954]

Thanks sir ❤❤❤

[@mohandask1328]

if we are not using recursion, the same output can be get by....... int fun(int n); int main() { int i; for(i=1;i

[@basavaraj9590]

This one is which problem Bhai.. print o/p upto from 1 to 10 numbers

[@Vinay_singh01]

GOOD sir

[@arghyasaha8370]

Great explanation❤

[@raktimagupta9605]

your voice >>>

[@nityanandrai5341]

a very simple code for above question #include using namespace std; void fun(int n) { if(n==0) { return; } fun(n-1); if(n%2==0) cout

[@iluvyunie]

Wow. This is really helpful

[@chandanpurbey1058]

Well explained.

[@Karan_mahra]

Respect....

[@nikhilguleria4313]

it's wonderfull explanation

[@mipa3868]

wow..amazing sir at 5:04...in cases like these ...will post increment operator not be a problem?

[@anirudh4692]

that's neat and clear...gud job

[@shashank6803]

By direct Recursion it looks like public class Print { public static int calculate(int n) { if(n>10) { return 0 ; } if(n%2==0)//even { System.out.print(n-1+" ") ; return calculate(n+1); }else{ System.out.print((n+1)+" "); return calculate(n+1); } } public static void main(String[] args) { int n=1 ; calculate(n); } }

[@compangit1524]

Comment for myself: 1st step is find the recursive flow, 2nd step is find the base case. The base case is the case that doesn't need to call the function itself again.

[@-HarishkumarG]

you are the best

[@kushalavardhan]

in the user defined functions, we wrote If statement and we related values of n and 10. here, what does n mean??? there is no definition of n in any of the functions. in global scope (if compiles goes out) n value is "1". how each function call remembers the value of "n"??

[@stranger5548]

Same doubt pls ans

[@sabreenparween9696]

Really osm concept😍

[@sayyedaaman5719]

Amazing video thank you for explain it

[@tanishajaiswal7559]

You made it seem so easy

[@cheery3469]

Omg...where i was... thnk u

[@HelloWorld40408]

Thank You sir

[@anurani548]

Very nice explanation

[@daverussell4052]

you basicly dont need the return because void functions is a non-return functions

[@juliuskamara1348]

Thank you very much. Do we still return statement for void return type?

[@harshvardhananand8795]

Nicely explained

[@TehreemAyesha]

What would have happened if there was pre increment in place of post increment?

[@ritikshrivastava9442]

If somebody wants to know the same program without indirect recursion 👇 int main() { for(int i = 1; i

[@codemonster8240]

realy helpfull

[@b.himanshu2654]

Superb

[@rohanghosh9700]

Sir ouput should show in opposite order because it was in stack

[@sasikumartangala5001]

Sir for this programme we need to write the even and odd logics right

[@nitinadarsh]

No He just initialised the variable with n = 1, and after that it falls in the odd function and we increment the value and send it to even function. So no need to write logic for odd and even.

[@educationalonly5941]

No ,here we have declared no. From 1(kept in odd fun.) sequentialy no. is incriminating in function itself. Then Obviously the next no is of even type and next odd and so on .

[@marvelshorts2.o337]

suprab expalnation sir

[@true4189]

Thank u

[@SanjeevKumar-wt9bs]

sir,please solve indirect recursion question, gate 2017

[@namastebhai855]

Then what is significance of writing "return 0" in main function?

[@binoyabraham4559]

in this program we should return (n) right ?becoz i learned that only a variable which is declared in a function ......only that function can access to it ...if u want to access in other function u have to return it na

[@swarajchoudhary1862]

Over Here how after decreament in even function the n value increases by 2 ?????

[@ReflectingOurselves]

#include int i; int main() { for(i=1;i

[@JathinShyam]

In the void functions, why u typed return?

[@jeevaalok1467]

Yea I too have same doubt

[@mdkaiserali6830]

awesome

[@Hell2026]

You are an outstanding explanation sir but what you have written is that syntax or example? Please give me reply sir

[@jeevaalok1467]

Example ig

[@bsaikumarreddy1413]

Please upload video fastly sir It’s a kind request

[@sudhanshuranjan7629]

By what date should we expect next lectures?

[@tomcruise6618]

Sir why is void used before function??

[@fasasiwasiu7533]

In video 76(How to write Recursive Functions) you mentioned that if block only should contain Base Case, while else block should contain Recursive Procedure. But in this video, your if block contains Recursive Procedure, while your else block contains Base case. Please can you explain what happened here, thanks

[@juliuskamara1348]

I think hence the base case is been define, doesn't matter whether in an if or while.

[@CSEEswarGuptha]

In function defination why we are using void odd,void even

[@jeevaalok1467]

Same doubt

[@knSharooq]

is it necessary to use return; ??? if it is not used then also result will be same right??

[@manavjain3930]

Man jae sir

[@compangit1524]

Comment for myself: Indirect Recursion happens, when the recursion doesn't only happen on the function body alone of the function caller.

[@educationalonly5941]

how the return; works? Pls. Explain..

[@asha0523]

Mast

[@sahil_singhai]

Why we have declared int n =1; in a global variable or not as an inside main function?

[@cuteonigiri1671]

because if not, it will only be available in main function. unless u use call by reference(pointer).

[@eve7722]

Hello when we return value why void came instead of that int may be come

[@M4LICIOUS]

You sure WAP is 'write a program"?,lol🙃

[@johnychinese]

I came looking for this comment 😂

[@الكليةالتقنيةالهندسيةفيميسان]

how to transfer (n) between odd and even ??? odd()>>>even()!!! how each function call remembers the value of "n"??

[@mickey5280]

Can someone explain to me why don't he use void not if else?

[@sahilsaxena8374]

Void odd() It's return how it is possible Void means it's doesn't return???

[@bantuthakur9959]

Hey odd and even function not return any value, it only print on its own function but doesn't return any value.

[@sahilsaxena8374]

Why we write return statement??

[@bantuthakur9959]

@@sahilsaxena8374 to return some value to the function

[@rishabh7011]

@@sahilsaxena8374 to stop the execution of that function and return to previous function

[@HarshaVardhan-kt5uu]

Nice question 👍

[@HARE_KRISHNA_2399]

But how does the compiler know that which is odd number and which is even ??

[@georgiilkov9915]

A bit late here but we start with 1 which we as humans know is odd. So we make it call odd() first.The number after an odd number is an even one. After an even number follows an odd one. And so on until we reach 11

[@jeevaalok1467]

compiler knows some inbuilt functions ig

[@jonasasare5775]

We are returning an integer to the main fun but why is the data type of odd fun and even fun void

[@johnychinese]

WAP == Write a program Everybody knows that 😂

[@jayaprakashl8592]

in the even function, the if condition and the return statement are useless.

[@ameykulkarni8165]

are those types applicable in java?

[@FarhanAli-gd2qv]

What if we do not write return; statement in even and odd function. I didn't write it in my program and I didn't got any type of error. Program executed properly. What if we do not use it or is it necessary to use, if yes then why?

[@bablu1921]

Because we're using a void data type so it doesn't expect anything in return

[@FarhanAli-gd2qv]

@@bablu1921 I know that but what about int return_type in function header. I have typed int in function header and didn't typed return statement inside function at the last and didn't got any error in the program. According to rules function must return an integer value if int is written in the function header.

[@bablu1921]

@@FarhanAli-gd2qv probably your compiler is smart lol Well then I can't say

[@FarhanAli-gd2qv]

@@bablu1921 you can try it too in the visual studio code.

[@FarhanAli-gd2qv]

@@bablu1921 I searched about this issue over stack overflow, over there a user said "it's ur choice whether you want to put it or not". But I need the reason. Why program is not generating any error ?

[@CostaKazistov]

Is it the same as Trampoline function?

[@hetaeramancer]

what's that?

[@b3nythomas284]

I wish i thought of WAP as write a program...

[@sumitchettri8399]

if we are already incrementing the value of n in the printf function then why are we incrementing it again??

[@FarhanAli-gd2qv]

incrementation of n variable in both functions are necessary.

[@FarhanAli-gd2qv]

Dry run your program then you will get to know.

[@indianmusic1770]

Why do you not execute the code

[@anoliverma4907]

Why is only odd function called in the main function? Why Even function is not called?

[@vallimaylvalliappan9489]

isnt it dynamic scoping then?

[@venkythesmart440]

so many member doubts this. Please reply me. Stack flowed only last in first out. This program not follow that. Return function how it is works. This I am not felt this recursion program

[@udbhavvikramsingh3449]

Can we write even (n++) instead even ( ) And not write n++

[@jeevaalok1467]

Yea it works

[@shovonanand023]

But i didn't understand how it knows that it's odd or even. No you didn't give any condition either.

[@omarboug681]

is my code right to ? it worked by the way int fact( int n ) { if( n % 2 == 0 ) { return n - 1 ; } else { return n + 1 ; } } int main() { int n = 1 ; for( n = 1 ; n

[@radha_preymi]

🥰🥰🥰💚

[@geekyskill4156]

sir it is not working it programe goes to infinity