Write a program in c to sort an unsorted array using bubble sort method?

#include<stdio.h>
#include<conio.h>
main()
{
int arr[50],temp,i,j,n;
clrscr();
printf("\nEnter any Value less Than 50");
scanf("%d",&n);
printf("\n\tEnter The Values into ARRAY ");
for(i=0;i<n;i++)
{
printf("\n\n Enter Element no %d: ",i+1);
scanf("%d",&arr[i]);
}
for(i=1;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(arr[j] >arr[j+1])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
printf("\n\n-- Sorted Series --");
for(i=0;i<n;i++)
{
printf("\n \n \t %d",arr[i]);
}
getch();

Insertion Sort
//Analysis of Algorithms
//Insertion Sorting - C Program
//Sort Array Using Insertion Function.
//Program by:- GAURAV AKRANI.
//TESTED:- OK
#include<stdio.h>
#include<conio.h>
void insertion(int a[],int n)
{
 int i,j,x,k;
for(i=1;i<=n-1;i++)
{
j=i;
x=a[i];

while(a[j-1]>x && j>0)

{
a[j]=a[j-1];
j=j-1;
}
a[j]=x;

printf("\n\n The array after pass no.%d: ",i);

for(k=0;k<=n-1;k++)
printf("%4d",a[k]);

}//end for.

} //end function.
void main()
{
int a[1000],n,i;
clrscr();
printf("\n\nEnter an integer value for total no.s of elements to be sor
ted: ");
scanf("%3d",&n);

for(i=0;i<=n-1;i++)
{
printf("\n\nEnter an integer value for element no.%d: ",i+1);
scanf("%4d",&a[i]);
}

insertion(a,n);

printf("\n\n\nFinally sorted array is : ");

for(i=0;i<=n-1;i++)
 printf("%4d",a[i]);

}//end program.
/*
----------sample output------------------

Enter an integer value for total no.s of elements to be sorted: 6

Enter an integer value for element no.1: 67

Enter an integer value for element no.2: 34

Enter an integer value for element no.3: -23

Enter an integer value for element no.4: 100

Enter an integer value for element no.5: 0

Enter an integer value for element no.6: -68

The array after pass no.1: 34 67 -23 100 0 -68

The array after pass no.2: -23 34 67 100 0 -68
The array after pass no.3: -23 34 67 100 0 -68
The array after pass no.4: -23 0 34 67 100 -68
The array after pass no.5: -68 -23 0 34 67 100

Finally sorted array is : -68 -23 0 34 67 100

*/

Selection sort

#include
#include
#define MAXSIZE 500
void selection(int elements[], int maxsize);
int elements[MAXSIZE],maxsize;
int main()
{
int i;
printf( \nHow many elements you want to sort: );
scanf( %d ,&maxsize);
printf( \nEnter the values one by one: );
for (i = 0; i < maxsize; i++)
{
printf ( \nEnter element %i : ,i);
scanf( %d ,&elements[i]);
}
printf( \nArray before sorting:\n );
for (i = 0; i < maxsize; i++)
printf( [%i], ,elements[i]);
printf ( \n );
selection(elements, maxsize);
printf( \nArray after sorting:\n );
for (i = 0; i < maxsize; i++)
printf( [%i], , elements[i]);
}
void selection(int elements[], int array_size)
{
int i, j, k;
int min, temp;
for (i = 0; i < maxsize-1; i++)
{
min = i;
for (j = i+1; j < maxsize; j++)
{
if (elements[j] < elements[min])
min = j;
}
temp = elements[i];
elements[i] = elements[min];
elements[min] = temp;
}
}