#include <stdio.h>
void bubblesort1(int arry[], int n);
void bubblesort2(int arry[], int n);
void bubblesort3(int arry[], int n);
int main()
{
int i;
int arry[6] = {23, 87, 0, 45, 21, 12};
for(i = 0; i < 6; i++)
{
printf("%d ", arry[i]);
}
printf("\n");
bubblesort1(arry, 6);
bubblesort2(arry, 6);
bubblesort3(arry, 6);
return 0;
}
void bubblesort1(int arry[], int n)
{
int max;
int i, j;
for(i = 0; i < n; i++)
{
for(j = n-1; j > i; j--)
{
if(arry[j] > arry[j-1])
{
max = arry[j];
arry[j] = arry[j-1];
arry[j-1] = max;
}
}
}
for(i = 0; i < n; i++)
{
printf("%d ", arry[i]);
}
printf("\n");
}
void bubblesort2(int arry [ ], int n)
{
int max;
int i, j;
for(i = 0; i < n; i++)
{
for(j = 0; j < n-i-1; j++)
{
if(arry[j] > arry[j+1])
{
max = arry[j];
arry[j] = arry[j+1];
arry[j+1] = max;
}
}
}
for(i = 0; i < n; i++)
{
printf("%d ", arry[i]);
}
printf("\n");
}
void bubblesort3(int arry [ ], int n)
{
int max;
int i, j;
for(i = 0; i < n; i++)
{
for(j = 0; j < n -1; j++)
{
if(arry[j] > arry[j+1])
{
max = arry[j];
arry[j] = arry[j+1];
arry[j+1] = max;
}
}
}
for(i = 0; i < n; i++)
{
printf("%d ", arry[i]);
}
printf("\n");
}