int array[] = {6,5,4,3,2,1};
int j;
int count = sizeof(array) / sizeof(array[0]);
for (int i = 0; i < count - 1; i++) {
for (j = 0; j < count - 1 - i; j++)
if (array[j] > array[j + 1]) {
int temp = 0;
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
for (j = 0; j < count; j++) {
printf("array[%d] = %d\n", j, array[j]);
}
C语言 简单的冒泡排序
最新推荐文章于 2024-07-15 12:54:34 发布