Skip to main content

Insertion sorting in c language

Insertion sorting in c language

Sorting is the process of arrenging data in ascending or decending order.
Like- dictionary
You think that if alphabets is not in sorted way how you can find any word.
To handle it we can sorted char,int.

THEORY-

in insertion sorting















each next element is compare all element behind it.

syntax-

#include<stdio.h>
int main()
{ int n,i,j,a[1000],temp;
printf("enter how many no you wanted to sort\n");
scanf("%d",&n);
printf("ENTER NO FOR SORTING\N");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
temp=a[i];
for(j=i-1;j>=0;j--)
if(a[j]>temp)
{
a[j+1]=a[j];
}
else
break;
a[j+1]=temp;
}
printf("SORTED \n");
for(i=0;i<n;i++)
{
printf("%d\n",a[i]);
}
}



                                        exit

if you have any doubt please comment.and tell me what topic you want to learn.
Labels:

Comments

Post a Comment

Popular posts from this blog

solution of TRICOUNT - Counting Triangles on spoj

  TRICOUNT - Counting Triangles solution- #include<stdio.h> int main() {     int t;     scanf("%d",&t);     while(t--)     {         long long unsigned num,sum;         scanf("%llu",&num);         if(num%2==0)         sum=(num*(num+2)*((2*num)+1))/8;         else         sum=((num*(num+2)*((2*num)+1))-1)/8;         printf("%llu\n",sum);     }     return 0; }
Post a Comment
Read more

solution of PRIME1 - Prime Generator on spoj

PRIME1 - Prime Generator solution- #include<stdio.h> #include<math.h> int main() {int t; long long int l,h,i,flag; scanf("%d",&t); while(t--) { scanf("%lld%lld",&l,&h); while(l<=h) { flag=0; for(i=2;i<=sqrt(l);i++) { if(l%i==0) { flag=1;     break; } } if(flag==0) { if(l!=1) printf("%lld\n",l); } l++; } printf("\n"); } return 0; }
Post a Comment
Read more