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
v\:* {behavior:url(#default#VML);} o\:* {behavior:url(#default#VML);} w\:* {behavior:url(#default#VML);} .shape {behavior:url(#default#VML);} Normal 0
C Program to check FACTORIAL main() { int i,j,m,fact,sum=0; clrscr(); printf("ENTER THE NO.: "); scanf("%d",&m);
Write a program to compute the following equation for values of time. y = 2x+3 The values of time are stored in the file program.dat and the solution should be display
To get the efficiency of Otto cycle by C/C++.
WAP TO PRINT SUM=1!+2!+3!+4!+....N! #include stdio.h> #include conio.h> void main() { int n,i; float sum=0,fac
Write in a file: void main() { int i,j,k,l,list[1000]; FILE *fp; char any[8]; cout cin >> any; fp = fopen(any,"wb"); for(j=0;j {
write a c++ program to update employee records
program to enter 5 values in queue and remove value one by one from queue.
There are ''n'' ants on a ''n+1'' length rod. The ants are numbered from 1 to n and are initially placed at positions starting from position 1 till position n. They are moving eith
Conversion Functions Conversion functions are member functions used for the following purposes: 1. Conversion of object to basic data type. 2. Conversion of basic data ty
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: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd