// 冒泡排序
void bubbleSort(int *array, int count)
{for (int i = 0; i < count - 1; i ++) {
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;
}
}
}
for (int i = 0; i < count; i ++) {
printf("%d\n", *(array + i));
}
printf("\n")
}
作为函数使用数组排序时,要传递数组长度(count)
// 选择排序
void selectSort(int *array, int count)
{
for (int i = 0; i < count - 1; i ++) {
int minIndex = i;
for (int j = i + 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\n", *(array + i));
}
}