冒泡排序
int array[] = {5,9,6,3,7,4,28,13,88,-6,-42,32};
int count = sizeof(array) / sizeof(array[0]);
int flag = 1;
for (int i = 0; i < count - 1 && 1 == flag; i++) {
flag = 0;
for (int j = 0; j < count - i - 1; j++) {
if (array[j] > array[j + 1]) {
int temp = 0;
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
flag = 1;
}
}
}
for (int i = 0; i < count; i++) {
printf("%d ", array[i]);
}
printf("\n");
选择排序
int array[] = {5,9,6,3,7,4,28,13,88,-6,-42,32};
int count = sizeof(array) / sizeof(array[0]);
for (int i = 0; i < count - 1; i++) {
int minIndex = i;
for (int j = minIndex + 1; j < count; j++) {
if (array[minIndex] > array[j]) {
minIndex = j;
}
}
if (minIndex != i) {
int temp = 0;
temp = array[minIndex];
array[minIndex] = array[i];
array[i] = temp;
}
}
for (int i = 0; i < count; i++) {
printf("%d ", array[i]);
}
printf("\n");