摘要:
正负相和 //正负项和 void code2_8() { int denominator = 1, flag = 1, i, n; double item = 1, sum = 0; scanf("%d", &n); for (i = 1; i <= n; i++) { sum += item; f 阅读全文
摘要:
快速排序 void quick_sort(int q[], int l, int r){ if (l >= r) return; int i = l - 1, j = r + 1, x = q[l + (r - l >> 1)]; while (i < j){ do i ++ ; while (q[ 阅读全文