#include <stdio.h>
int main() {
int a, b, c, t;
scanf("%d %d %d", &a, &b, &c);
if (a > b) { t = a; a = b; b = t; }
if (a > c) { t = a; a = c; c = t; }
if (b > c) { t = b; b = c; c = t; }
printf("%d %d %d\n", a, b, c);
return 0;
}
int arr[3];
for (int i = 0; i < 3; i++) scanf("%d", &arr[i]);
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2 - i; j++)
if (arr[j] > arr[j+1]) { t = arr[j]; arr[j] = arr[j+1]; arr[j+1] = t; }
for (int i = 0; i < 3; i++) printf("%d ", arr[i]);
#include <stdlib.h>
int cmp(const void *a, const void *b) { return *(int*)a - *(int*)b; }
qsort(arr, 3, sizeof(int), cmp);
參考鏈接:百度知道相關討論