Insertion Sort

 #include<stdio.h>

#include<conio.h>

void main()

{

int arr[99], no, i, j, temp;

clrscr();

printf("Enter number of elements: ");

scanf("%d", &no);

printf("Enter %d integers: ", no);

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

{

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

}

for (i = 1; i < no; i++)

{

temp = arr[i];

j = i - 1;

while (j >= 0 && arr[j] > temp)

{

arr[j + 1] = arr[j]; // Move element to the right

j = j - 1;           // Move to the previous element

}

// Move origional element into its correct position

arr[j + 1] = temp;

}

printf("Sorted elements:\n");

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

{

printf("%d ", arr[i]);

}

printf("\n");

getch();

}

Selection Sort

#include<stdio.h>

#include<conio.h>

void main()

{

int a[99], no, i, j, min, temp;

clrscr();

printf("\nEnter size of an array: ");

scanf("%d", &no);

printf("\nEnter elements of an array:\n");

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

{

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

}

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

{

min = i;

for (j=i+1; j<no; j++)

{

if (a[j] < a[min])

min = j;

}

temp = a[i];

a[i] = a[min];

a[min] = temp;

}

printf("\n\nAfter sorting:\n");

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

{

printf("\n%d", a[i]);

}

getch();

}

Bubble Sort

 #include<stdio.h>

#include<conio.h>

void main()

{

int a[99],i,j,temp,no;

printf("\n Enter the max no.of Elements to Sort: \n");

scanf("%d",&no);

printf("\n Enter the Elements : \n");

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

{

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

}

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

{

for(j=i+1; j<no; j++)

{

if(a[i]>a[j])

{

temp=a[i];

a[i]=a[j];

a[j]=temp;

}

}

}

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

{

printf("%d\t",a[i]);

}

getch();

}