將n個(gè)數(shù)按輸入時(shí)順序的逆序排列，用函數(shù)實(shí)現(xiàn)。

熱心網(wǎng)友

void reverse(int *a, int n){int i, k;for (i = 0; i < n/2; i++){k = a[i]; a[i] = a[n-1-i]; a[n-1-i] = k;}}void main(){int n[10], i;printf("please enter 10 numbers: \n");for (i = 0; i < 10; i++) scanf("%d", &n[i]);reverse(n, i);for (i = 0; i < 10; i++) printf("%d ", n[i]);}

熱心網(wǎng)友

請(qǐng)采納我的答案。 #includesorted(int *a, int n){int term, i;for (i=0; i<=(n-1)/2; i++){term = *(a + i);*(a + i) = *(a + n - i -1);*(a + n - i -1) = term;}}#define N 10main(){int array[N], i;printf("input the original array:\n");for (i=0; i

熱心網(wǎng)友

void main(){int i,n;char k;printf("input the string\n");char str[30];scanf("%s\n",str);for (i = 0; i < n/2; i++){k = str[i]; str[i] = str[n-1-i]; str[n-1-i] = k;}for (i = 0; i < 10; i++) printf("%d ", str[i]);}