Thursday, December 5, 2013

Bubble sort : C program



#include<stdio.h>

void main()

{
  //int a[] = {2,5,4,7,10,8,9,1,3,6};
// int a[] = {1,2,3,4,5,6,7,8,9,10};
  int a[] = {10,9,8,7,6,5,4,3,2,1};
  int n = 10;
  int i=0;
 int j=0;
 int k =0;
 int temp=0;
 int count = 0;
 printf("\n");
 for(i=0;i<n;i++)
 printf("%d ",a[i]);

 for(i=0;i<n;i++)
 {
         for(j=0;j<(n-i-1);j++)
         {
                    if(a[j] > a[j+1])
                    {       //count++;
                            temp = a[j];
                            a[j] = a[j+1];
                            a[j+1] = temp;
                    }        
                            
         }
  //    printf("\n");        
   // for(k=0;k<n;k++)
   //   printf("%d ",a[k]);     
           
 }

 printf("\n");
 for(i=0;i<n;i++)
 printf("%d ",a[i]);
//  printf("%d ",count);
   getch();   
  
}

No comments:

Post a Comment