C language interview questions solution for freshers beginners placement tricky good pointers answers explanation operators data types arrays structures functions recursion preprocessors looping file handling strings switch case if else printf advance linux objective mcq faq online written test prime numbers Armstrong Fibonacci series factorial palindrome code programs examples on c++ tutorials and pdf
Multiplication using recursion in c
Sum of n numbers using recursion in c
Matrix multiplication using recursion in c
Multiplication using recursion in c
Lcm using recursion in c
Using recursion in c find the largest element in an array
Prime number program in c using recursion
Decimal to binary conversion in c using recursion
C program for fibonacci series using recursion
Reverse a string using recursion
Write a program for palindrome using recursion
Find factorial of a number using recursion in c program
Find gcd of a number using recursion in c program
Find sum of digits of a number using recursion using cprogram
Find power of a number using recursion using c program
Binary search through recurssion using c program
Reverse a number using recursion in c program
Big list of c program examples
Subscribe to:
Post Comments (Atom)
8 comments:
y como seria el mismo programa pero con numeros demasiados grandes, es decir, usando cadenas para poder imprimirlas
por cierto buen programa
int multiply(int a,int b){
if (b == 0) return 0;
return a + multiply(a, b - 1);
}
please explain........ how it wrkss???????????????????
keep it up... (y)
this is will be better when improved because when the first number entered is a negative number and when both numbers are negative it does not give the right answer.
Awesome and easy logic from sudipto choudury
int multiply(int a,int b,int i)
{
if(i>a-1)
return(0);
else
return(b+multiply(a,b,i+1));
}
Be aware! The author's original code for recursion does not work.
Post a Comment