Recursive-Insertion Sort January 11, 2010

//recursive insertion-sort
#include<stdio.h>

void insert(int a[],int k)
{
 int i,j,key;
 key=a[k];
 i=k-1;
 while(i>=0&&a[i]>key)
 {
  a[i+1]=a[i];
  i--;
 }
 a[i+1]=key;
}
 



void rinsertionsort(int a[],int n)
{
  if(n>1)
    rinsertionsort(a,n-1);
  insert(a,n);
}


int main()
{
 int a[100];
 int i,j,k,l,m,n,item;
 printf("\n enter the number of elements\n");
 scanf("%d",&n);
 printf("enter the elemnts\n");
 for(i=0;i<n;i++)
  scanf("%d",&a[i]); 

 
 rinsertionsort(a,n);

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

return 0;
}

Insertion-sort January 11, 2010

//Insertion sort(my implemntation) 

#include<stdio.h>
int main()
{
 int a[100];
 int i,j,k,l,m,n,item;
 printf("\n enter the number of elements\n");
 scanf("%d",&n);
 printf("enter the elemnts\n");
 for(i=0;i<n;i++)
  scanf("%d",&a[i]); 


 for(i=0;i<n;i++)
 {
   k=i;
   item=a[i];
 
   for(j=k-1;j>=0;j--)
   {
     if(item<a[j])
      a[j+1]=a[j];
     else
      break;
   }
   a[j+1]=item;
} 
 for(i=0;i<n;i++)
  printf("%d  ",a[i]);

return 0;
}

Insertion-sort(my childish way) January 10, 2010

//Insertion sort Dummy(childish way -my first implemntation)

#include<stdio.h>
int main()
{
 int a[100];
 int i,j,k,l,m,n,item,flag;

 scanf("%d",&n);
 for(i=0;i<n;i++)
  scanf("%d",&a[i]); 


 for(i=0;i<n;i++)
 {
   k=i;
   item=a[i];
   flag=0;
   for(j=0;j<k;j++)
   {
     if(a[j]>item)
     { m=j;flag=1;break;}
     else
     continue;
   }
   if(flag==1){
   for(l=k;l>m;l--)
    a[l]=a[l-1];
   a[m]=item;
   }
} 
 for(i=0;i<n;i++)
  printf("%d  ",a[i]);

return 0;
}