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

preview_player
Показать описание
C Programming: Types of Recursion in C Language.
Topics discussed:
1) Direct recursion.
2) Example of direct recursion.
3) Indirect recursion.
4) Example of indirect recursion.

Music:
Axol x Alex Skrindo - You [NCS Release]

#CProgrammingByNeso #CProgramming #Recursion
Рекомендации по теме
Комментарии
Автор

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

AJewFR
Автор

one day there will be billions of viewers in your tutorial

saifulislamsarfaraz
Автор

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

HosBarGamers
Автор

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

aradhanasoni
Автор

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

MrTomro
Автор

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

sanjaykarthicks
Автор

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

piyushji
Автор

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.

surbhitamrakar
Автор

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

enjoylearning
Автор

Answer for homework problem is 15. Thank you

mani_vk_
Автор

Bro where were you this whole 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.

name-iqon
Автор

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

yusraabdullah
Автор

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"??

kushalava
Автор

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

anchalagrawal
Автор

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);
}

accessdenied
Автор

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

pariminagalakshmi
Автор

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();
}

Adityasharma-oezp
Автор

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

rileshkhatri
Автор

In the void functions, why u typed return?

kshyamkumarreddy
Автор

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

batsmanist