Linear Search

#include<stdio.h>
#include<string.h>
struct Array
{
char A[100][100];
int size;
int length;
};
int LS(struct Array arr,char key[15])
{
int i;
for(i=0;i<arr.length;i++)
if(strcmp(key,arr.A[i])==0)
return i;
return -1;
}
int main()
{
struct Array arr1;
printf("Enter the length of array: ");
scanf("%d",&arr1.length);
printf("Enter the elements: ");
for(int i=0;i<arr1.length;i++)
scanf("%s",arr1.A[i]);
printf("Enter the element to be searched: ");
char key[100];
scanf("%s",&key);
int index=LS(arr1,key);
if(index>-1)
printf("Search Element: %s\nIndex: %d",key,index);
else
printf("Element not found");
return 0;
}

Binary Search:

#include<stdio.h>
struct Array
{
int A[10];
int size;
int length;
};
int BinarySearch(struct Array arr,int key)
{
int l,mid,h;
l=0;
h=arr.length-1;
while(l<=h)
{
mid=(l+h)/2;
if(key==arr.A[mid])
return mid;
else if(key<arr.A[mid])
h=mid-1;
else
l=mid+1;
 }
return -1;
}
int main()
{
struct Array arr1;
printf("Enter the length of array: ");
scanf("%d",&arr1.length);
printf("Enter the elements: ");
for(int i=0;i<arr1.length;i++)
scanf("%d",&arr1.A[i]);
printf("Enter the element to be searched: ");
int key;
scanf("%d",&key);
int index=BinarySearch(arr1,key);
if(index>-1)
printf("Search element: %d \nIndex=%d",key,index);
else
printf("Element not found");
return 0;
}

Bubble sorting
#include <stdio.h>
#include<stdlib.h>
void swap(int *x,int *y)
{
int temp=*x;
*x=*y;
*y=temp;
}
void Bubble(int A[],int n)
{
int i,j,f=0;
for(i=0;i<n-1;i++)
{
flag=0;
for(j=0;j<n-i-1;j++)
{
if(A[j]>A[j+1])
{
swap(&A[j],&A[j+1]);
f=1;
}
}
if(f==0)
break;
}
}
int main()
{
int n;
printf("Enter the size of an array: ");
scanf("%d",&n);
int A[n];
printf("Enter the elements: ");
for(int i=0;i<n;i++)
scanf("%d",&A[i]);
Bubble(A,n);
 printf("Sorted Array: ");
for(int i=0;i<n;i++)
printf("%d ",A[i]);
printf("\n");
return 0;
}

Insertion sort
#include <stdio.h>
#include<stdlib.h>
void swap(char *x,char *y)
{
char temp=*x;
*x=*y;
*y=temp;
}
void SelectionSort(char A[],int n)
{
int i,j,k;
for(i=0;i<n-1;i++)
{
for(j=k=i;j<n;j++)
{
if(A[j]<A[k])
k=j;
}
swap(&A[i],&A[k]);
}
}
int main()
{
int n;
printf("Enter the size of an array: ");
scanf("%d",&n);
char A[n];
printf("Enter the elements: ");
for(int i=0;i<n;i++)
scanf("%c",&A[i]);
SelectionSort(A,n);
printf("Sorted Array: ");
for(int i=0;i<n;i++)
printf("%c ",A[i]);
printf("\n");
return 0;
}

Selection sort:
#include <stdio.h>
#include<stdlib.h>
void swap(int *x,int *y)
{
int temp=*x;
*x=*y;
*y=temp;
}
void SelectionSort(int A[],int n)
{
int i,j,k;
for(i=0;i<n-1;i++)
 {
for(j=k=i;j<n;j++)
{
if(A[j]<A[k])
k=j;
}
swap(&A[i],&A[k]);
}
}
int main()
{
int n;
printf("Enter the size of an array: ");
scanf("%d",&n);
int A[n];
printf("Enter the elements: ");
for(int i=0;i<n;i++)
{
scanf("%d",&A[i]);
}
SelectionSort(A,n);
printf("Sorted Array: ");
for(int i=0;i<n;i++)
printf("%d ",A[i]);
printf("\n");
return 0;
}