1、将一整数逆序后放入一数组中（要求递归实现）.docVIP

1、将一整数逆序后放入一数组中（要求递归实现） void convert(int *result, int n) { ???? if(n=10) ???????? convert(result+1, n/10); ???? *result = n%10;??? } int main(int argc, char* argv[]) { ???? int n = 123456789, result[20]={}; ???? convert(result, n); ???? printf(%d:, n); ???? for(int i=0; i9; i++) ???????? printf(%d, result[i]); } ? 2、求高于平均分的学生学号及成绩（学号和成绩人工输入） double find(int total, int n) { ???? int number, score,? average; ???? scanf(%d, number); ???? if(number != 0) { ???????? scanf(%d, score); ???????? average = find(total+score, n+1); ???????? if(score = average) ????????????? printf(%d:%d\n, number, score