123
123
123
int fibonacci(int n)
{
if(n==1)
return(1);
else if(n==2)
return(1);
else
return (fibonacci(n-1)+fibonacci(n-2));
}
Output:
Enter a number: 6
The number which is situated in the place of 6 is :8
Process returned 0 (0x0) execution time : 6.424 s
Output
Output:
Enter the value of n:5
Enter the value of r:3
The NCR value is: 10
Process returned 0 (0x0) execution time : 4.234 s
47.To sort the elements in ascending order using arrays and functions
//Program to sort the elements in ascending order using arrays and functions//
#include<stdio.h>
int main()
{
int minin,i,n,num[10],temp,num2[10];
printf("Enter the number of items:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("Enter number%d : ",i+1);
scanf("%d",&num[i]);
}
printf("\n The numbers before sort:\n");
for(i=0;i<n;i++)
printf("%d\t",num[i]);
sort(n,num);
return 0;
}
int sort(int n1,int no[10])
{
int minin,i,j,temp;
for(i=0;i<n1-1;i++)
{
minin=i;
for(j=i+1;j<n1;j++)
{
if(no[j]<no[minin])
minin=j;
}
if(minin!=i)
{
temp=no[i];
no[i]=no[minin];
no[minin]=temp;
}
}
printf("\n The numbers after sort:\n");
for(i=0;i<n1;i++)
printf("%d\t",no[i]);
}
Output:
41. Program to find maximum, minimum, Sum and average using arrays
//Max,min,Sum,Avg using arrays//
#include<stdio.h>
int main()
{
int max,min,i,j,avg,sum=0,num[10];
for(i=0;i<10;i++)
{
printf("Enter number %d:",i+1);
scanf("%d",&num[i]);
sum=sum+num[i];
}
max=min=num[0];
avg=sum/10;
for(j=1;j<10;j++)
{
if(max<num[j])
max=num[j];
if(min>num[j])
min=num[j];
}
printf("\n The maximum of the given numbers:%d",max);
printf("\n The minimum of the given numbers:%d",min);
printf("\n The sum:%d",sum);
printf("\n the average:%d",avg);
return 0;
}
Output:
Enter number 1:5
Enter number 2:7
Enter number 3:10
Enter number 4:18
Enter number 5:23
Enter number 6:9
Enter number 7:51
Enter number 8:90
Enter number 9:12
Enter number 10:13
Output:
Enter number1 : 23
Enter number2 : 34
Enter number3 : 56
Enter number4 : 777
Enter number5 : 78
Enter number6 : 89
Enter number7 : 90
printf(" %d",a[i][j]);
printf("\t");
for(j=0;j<n;j++)
printf(" %d",b[i][j]);
printf("\n");
}
printf("\n Added matrix \n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf(" %d",c[i][j]);
printf("\n");
}
return 0;
Output:
Added matrix
89 122
67 77
Output:
Enter the order of matrix 1
2
2
Enter the number of columns in 2 nd matrix:3
Enter A(1,1)=1
Enter A(1,2)=2
Enter A(2,1)=3
Enter A(2,2)=4
Enter B(1,1)=2
Enter B(1,2)=3
Enter B(1,3)=4
Enter B(2,1)=5
Enter B(2,2)=2
Enter B(2,3)=3
The resultant matrix when A and B are multplied
Matrix A and Matrix B are
1 2
3 4
2 3 4
5 2 3
Matrix C
12 7 10
26 17 24
Pascal
#include<stdio.h>
int main()
{
int sum=0,i,j,k,n,nc;
printf("Enter the number of rows:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i;j++)
{
printf(" ");
}
for(k=1;k<=i;k++)
{
printf("%d ",fncr(i-1,k-1));
}
printf("\n");
}
return 0;
}
int fncr(int n,int r)
{
int p;
if(n==r)
return(1);
else if(n>r)
{
p=factorial(n)/(factorial(r)*factorial(n-r));
return(p);
}
else if(n<r)
{
return (0);
}
}
int factorial(int x)
{
int i,q;
if(x==0)
return(1);
else if(x>0)
{
q=x*factorial(x-1);
return(q);
}
}
Enter the number of rows:5
1
11
121
1331
14641
#include<stdio.h>
int main()
{
char str[15];
int d,n,i;
printf("Enter a string:");
scanf("%s",&str);
n=strlen(str);
for(i=0;i<=n;i++)
{
if(str[i]!=str[n-i-1])
{
d=1;
break;
}
}
if(d==1)
{
printf("It is not a palindrome");
}
else
printf("It is a palindrome");
return 0;
}
Enter a string:ab123321ba
It is a palindrome
Process returned 0 (0x0) execution time : 6.886 s
Press any key to continue.
Enter a string:run
It is not a palindrome
Process returned 0 (0x0) execution time : 4.004 s