Insertion sort

Program:

#include<stdio.h>
int main()
{
int a[100],n,temp,i,j;
printf("Enter no. of elements: \n");
scanf("%d",&n);
printf("Enter array elements: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<n;i++)
{
temp = a[i];
for(j=i-1;j>=0 && temp<a[j] ;j--)
{
a[j+1] = a[j];
}
a[j+1]=temp;
}
printf("Sorted elements...\n");
for(i=0;i<n;i++)
{
printf("%d\t",a[i]);
}
    return 0;

}

Output:

Selection sort

Program:

#include<stdio.h>
int main()
{
int a[100],i,j,temp,n,k;
printf("Enter no. of elements: \n");
scanf("%d",&n);
printf("Enter array elements: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
k=i;
for(j=i;j<n;j++)
{
if(a[k]>a[j])
{
k=j;
}
}
if(k!=i)
{
temp=a[k];
a[k]=a[i];
a[i]=temp;
}
}
printf("Sorted elements...\n");
for(i=0;i<n;i++)
{
printf("%d\t",a[i]);
}
return 0;

}

Output:

Bubble sort

Program:

#include<stdio.h>
int main()
{
int a[50],i,j,temp,n;
printf("Enter no. of elements: \n");
scanf("%d",&n);
printf("Enter array elements: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("Sorted elements...\n");
for(i=0;i<n;i++)
{
printf("%4d",a[i]);
}
return 0;
}

Output: