Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
C program to Print Fibonacci series upto n using recursion:
int fibo(long int);
void main()
{
long int a=0,n;
printf ("how many terms");
scanf("%d",&n);
for(int i=1;i<=n;i++)
{a=fibo(i);
printf("%d ",a);
}
fibo(long int m)
long int x;
if(m>2)
x=fibo(m-1)+fibo(m-2);
return x;
else if(m==2)
return 1;
else if(m==1)
{return 0;}
OUTPUT
Hotel package
Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.
one of the segments is showing compilation error...
¦It should ask customers to enter details such as their names and addresses. ¦It should print a welcome message that includes the customer’s name. ¦It should provide a list of avai
Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books
Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the permutation that lexicographically precedes the given input permutation. If the given
C Program for FUNCTION OF COMPOUND INTEREST float ci(float,float,float); void main() { float p=0,r=0,n=0,k=0; clrscr(); printf("EN
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b
B-tree: A B-tree is an also called balanced m-way tree. A node of the tree may have many records or key and pointers to children. It is also called as the balanced sort tree. It s
what is spanning tree? explain prims algorithm spanning tree?
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd