Linear Search

#include<stdio.h>

void main()

int A[5],i,target,f=0;

printf("Enter the array\n");

for(i=0;i<5;i++)

scanf("%d",&A[i]);

printf("values of array are\n");

for(i=0;i<5;i++)

printf("%4d",A[i]);

printf("Target element\n");

scanf("%d",&target);

for(i=0;i<5;i++)

if(A[i]==target)

f=1;
 printf("%4d element found at %d location\n",target,i+1);

break;

if(f==0)

printf("%d elements not found at any location",target);

Binary Search
#include<stdio.h>

void main()
{
int A[100],i,first,mid,last,target,n;
printf("Enter the size of array\n");
scanf("%d",&n);
printf("Enter the array\n");
for(i=0;i<n;i++)
{
scanf("%d",&A[i]);
}

printf("values of array are\n");

for(i=0;i<n;i++)
{
printf("%4d",A[i]);
}

printf("Target element\n");
scanf("%d",&target);
first=0;
last=n-1;
mid=(first+last)/2;

while(first<=last)
{
if(A[mid]<target)
first=mid+1;
else if(A[mid]==target)
{
printf("%4d element found at %d location\n",target,mid+1);
break;
}
else
last=mid-1;
mid=(first+last)/2;
 }
if(first>last)
printf("%d elements not found at any location",target);
}

Fibonacci Series

#include <stdio.h>
int fib(int x);
int main()
{
int n,i;
printf("Enter the term\n\n");
scanf("%d",&n);
printf("Fibonaccie series are\n\n");
for(i=0;i<n;i++)
{
printf("%d",fib(i));
}
return 0;
}
int fib(int x)
{
if(x==0)
return 0;
else if(x==1)
return 1;
else
return(fib(x-1)+fib(x-2));
}

Function with Array (input array and display by function)

#include <stdio.h>
int disp(int x[ ],int n1);
int main()
{
int n,A[10],i;
printf("Enter the term\n\n");
scanf("%d",&n);
printf("Values are\n\n");
for(i=0;i<n;i++)
{
 scanf("%d",&A[i]);
}

disp(A,n);
return 0;
}

int disp(int x[ ],int n1)

{
int i;
for(i=0;i<n1;i++)
{
printf("%4d",x[i]);
}
}

Insertion sort
#include<stdio.h>

void main()
{
int A[10],i,j,t,n;
printf("Enter the size\n");
scanf("%d",&n);
printf("Enter the values of array\n\n");
for(i=0;i<n;i++)
{
scanf("%d",&A[i]);
}

for(i=1;i<n;i++)
{
t=A[i];
j=i-1;
while(t<A[j]&&j>=0)
{
A[j+1]=A[j];
j=j-1;
}
A[j+1]=t;
}

printf("Sorted Array is \n\n");

for(i=0;i<n;i++)
{
 printf("%4d",A[i]);
}

Bubble sort,Selection sort and insertion sort using function

#include<stdio.h>
void bsort(int X[ ],int n1);
void ssort(int X[ ],int n1);
void isort(int X[ ],int n1);
void main()
{
int A[10],i,n;
printf("Enter the size \n\n");
scanf("%d",&n);
printf("Enter the values of array\n\n ");
for(i=0;i<n;i++)
{
scanf("%d",&A[i]);
}

bsort(A,n);
ssort(A,n);
 isort(A,n);
}

void bsort(int X[ ],int n1)

{
int t,i,j;
for(i=0;i<n1-1;i++)
{
for(j=0;j<n1-1-i;j++)
{

if(X[j]>X[j+1])
{
t=X[j];
X[j]=X[j+1];
X[j+1]=t;
}
}
}
printf("Sorted values of array by bubble sort\n\n ");
for(i=0;i<n1;i++)
{
 printf("%4d",X[i]);
}

void ssort(int X[ ],int n1)

{
int t,i,j;
for(i=0;i<n1-1;i++)
{
for(j=i+1;j<n1-1;j++)
{

if(X[i]>X[j])
{
t=X[i];
X[i]=X[j];
X[j]=t;
}
}
}
printf("\n\nSorted values of array by selection sort\n\n ");
 for(i=0;i<n1;i++)
{
printf("%4d",X[i]);
}

void isort(int X[ ],int n1)

{
int t,i,j;
for(i=1;i<n1;i++)
{
t=X[i];
j=i-1;
while(t<X[j]&&j>=0)
{
X[j+1]=X[j];
j=j-1;
}
t=X[j+1];
}
 printf("\n\nSorted values of array by insertion sort\n\n ");
for(i=0;i<n1;i++)
{
printf("%4d",X[i]);
}