Recursion explained easily with factorial example. What happens in the background when a recursive call is made is explained in detail. C programming playlist • Introduction to C prog... English channel link, / @logicfirst31
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
#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".