Posted by guddu | 3:06 AM

#include
#include
void main()
{
int i,j,select[]={12,24,36,32,78},k;
printf("Bubble Sort\n");
for(i=5;i>1;i--)
{
for(j=0;jselect[j+1])
{
k=select[j];
select[j]=select[j+1];
select[j]=k;
}
}
}
for(i=0;i<5;i++)
printf("%d\n",select[i]);
}
}


2 comments
  1. guddu December 23, 2009 at 3:19 AM  

    any one can calculate the time complexity of this algorithm.

  2. guddu December 23, 2009 at 3:21 AM  

    Please post soon....

 
free website hit counter
free-website-hit-counters.com