题解 | #牛牛的排序#
牛牛的排序
https://www.nowcoder.com/practice/26a0c92e9266443887a3bf81aff8e188
#include <stdio.h>
#include <stdlib.h>
void sort(int *array, int n);
int main()
{
int n;
int i;
scanf("%d", &n);
int *array = (int*)malloc(n * sizeof(int));//动态数组
for (i = 0; i < n; i++)
scanf("%d", &array[i]);
sort(array, n);
for (i = 0; i < n; i++)
printf("%d ", array[i]);
return 0;
}
void sort(int *array, int n)
{
int temp;
int i, j;
for (i = 0; i < n - 1; i++)
for (j = 0; j < n - 1 - i; j++)
if (array[j] > array[j + 1])
{
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
查看1道真题和解析
