Recursion in C with factorial program | C Programming in tamil | Logic First Tamil

[@naveenkarthik2801]

I am a biology student but now studying mechanical engineering. I don't have any such a basic knowledge of programming. So, I feel very hard to understand the programmes and coding. After watching this video, I am very clear i. Recursion topic. Thanks

[@shanmugamadhavan184]

Fantastic Mam...!!!! Great Job
Thanks Lot

[@LogicFirstTamil]

Please check other videos in the channel and also pls share with your friends.

[@shanmugamadhavan184]

@@LogicFirstTamil Defenetly Mam
it's my pleasure 🥰

[@தமிழ்படங்கள்-ழ6ட]

@@LogicFirstTamil madam you have to use long keyword in instead of "int" in int fact (int n)

[@thamizhsivagami3515]

vera level explanation

[@nithyakiruba8219]

Very clear explanation mam. Very very thank you mam

[@kuttykutty6284]

Explaining vera level...mam

[@NaveenKumar-vl6xv]

Good explanation in recursion topic

[@najmudheenkalapatil78]

Excellent 👍👍

[@mohansastraite6666]

Awesome explanation mam

[@ChandraGanesh-in9rp]

I came from your js video

[@Praveen-l6r]

1000th like 😅

[@Infinityy37]

Hi sister.Can you show how to do fibonacci like factorial?

[@laxshanpanchavarnan3655]

Thanks you ❤️

[@ayyanar1438]

Thanks Madam🙏

[@reeshmashama]

well explained

[@sssureshtriples6686]

Thanks mam

[@taeya3907]

In that main function, if we gave it as int main... then we have to write return 0 at the end or not?

[@LogicFirstTamil]

yes. we should

[@Surya-bd4ec]

super

[@harishharish445]

Ma'am how to student mark recursion vachu yepadi program pannadhu if goto illa ma

[@srirengan5326]

👍

[@nalanahathavan145]

🔥

[@livin7673]

#include
int checkForPrime(int);
int i;
int main()
{
int n1,primeNo;
printf("\t Recursion : Check a number is prime number or not :
");
printf(" Enter any number : ");
scanf("%d",&n1);
i = n1/2;
primeNo = checkForPrime(n1);
if(primeNo==1)
printf(" The number %d is a prime number.
",n1);
else
printf(" The number %d is not a prime number.
",n1);
return 0;
}
int checkForPrime(int n1)
{
if(i==1)
{
return 1;
}
else if(n1 % i == 0)
{
return 0;
}
else
{
i = i - 1;
checkForPrime(n1);
}
}
mam i have a doubt in this code. i understoood the use of i in this code. But, what is logic behind "i=n1/2".

[@jerry9238]

Thank you!