#include<stdio.h>
void maopao(int a[], int length);
int main(void)
{
int n;
scanf_s("%d", &n);
int num[100] = { 0 };
for (int cnt = 0; cnt < n; cnt++)
{
scanf_s("%d", &num[cnt]);
}
maopao(num, n);
for (int cnt = 0; cnt < n; cnt++)
{
printf("%d", num[cnt]);
}
return 0;
}
void maopao(int a[], int length)
{
int i, j;
int temp;
for (i = 0; i < length - 1; i++)
{
for (j = i + 1; j < length; j++)
{
if (a[i] > a[j])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
}
思路:
每次i不动,由j充当i后面的数组内容,依次比较a[i]与a[j]的大小
从而实现把大的数或小的数往前调