打擂台排序与冒泡排序
C code:
#include <stdio.h>
#include <stdlib.h>
void print_array(int *array, int n)
{
int i;
for (i=0; i<n; i++)
{
printf("%d ", array[i]);
}
printf("\n");
}
void mysort(int *array, int n)
{
int i, j;
for (i=0; i<n-1; i++)
{
for (j=i+1; j<n; j++)
{
if (array[i]>array[j])
{
int tmp = array[i];
array[i] = array[j];
array[j] = tmp;
}
}
}
}
int main()
{
int array[8] = {49, 38, 65, 97, 76, 13, 27, 49};
print_array(array, 8);
mysort(array, 8);
print_array(array, 8);
return 0;
}
PS:有时间对比补充。