d:c;printf("max=%d/n" d c=5 b=6 tmp);} ||| #include<stdio.h>void main(){int a=3 tmp; if (a<b) tmp = a; else tmp = b; if (tmp > c) tmp = c; printf("%d/n" c=4 b = 2 直到 比完 肯定就是 最小的 被拽出来了 ||| #include <stdio.h>void main(){ int a = 6 谁小把谁拽出来比较 min); getch();} ||| 冒泡排序挨个比较 c)); printf("%d" bijiao(b min; min=bijiao(a c=3 b=2 int b){ if(a>b) return b; else return a;}main(){ int a=1 int c){ int min=a; if(min>b) min=b; if(min>c) min=c; return min;} ||| bijiao(int a int b int min(int a a:b;max=d>c c:a); max;d=a>b c:b):(a>c (b>c max);} ||| 问号冒号表达式 最简单 a>b