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:



No comments:

Post a Comment

x^y using recursion

Program: #include<stdio.h> int power(int a,int b); int main() { int x,y,ans; printf("Enter x and y:\n "); scanf(...