早已忘记的博客

#include <stdio.h>int main(){ int a[5] = {3, 5, 2, 1, 4}; int i, j, tmp, tmp1; int len = (int)(sizeof(a) / sizeof(a[0])); //从小到大排序 for (i = 0; i < len - 1; i++) { tmp = i; for (j = i + 1; j < len; j++) {.

#include <stdio.h>int main(){ int a[5] = {3, 5, 2, 1, 4}; int i, j, tmp; int len = (int)(sizeof(a) / sizeof(a[0])); //从小到大排序 for (i = 0; i < len - 1; i++) { for (j = 0; j < len - 1 - i; j++) { if (a[j.

#include <stdio.h>int main(){ int a[5] = {3, 5, 2, 1, 4}; int i, j, tmp; int len = (int)(sizeof(a) / sizeof(a[0])); //从小到大排序 for (i = 0; i < len - 1; i++) { for (j = i + 1; j < len; j++) { if (a[i] &g.

#include <stdio.h>int main(){ int a[5] = { 3, 5, 2, 1, 4 }; int i, j, tmp, pos; int len = (int)(sizeof(a) / sizeof(a[0])); // 从小到大排序 for (i = 1; i < len; i++) { pos = i - 1; tmp = a[i]; while ((pos &.

辗转相除法求最大公约数int main(){ unsigned int num1, num2, tmp; scanf("%u %u", &num1, &num2); if (num1 < num2) { tmp = num1; num1 = num2; num2 = tmp; //确保num1大于等于num2 } while (num2 != 0) { tmp = num1 % num2; //求余数 num1 = num2; num2 =