电子科大C语言实验4.docxVIP

第九章 编程题 1/****************************************************************************** *功能：整数组排序 * *selection_sort函数原理：1，找出数组中最大的数，把它移动到数组最后； * * 2，递归的调用本身对前n-1个数组元素排序。 * *****************************************************************************/#includestdio.hvoid selection_sort(int m, int a[]){int max = a[0];int i, j;for (i = 1, j = 0; i m; i++){if (max a[i]){max = a[i];j = i;}}a[j] = a[m - 1];a[m - 1] = max;if (m 2)selection_sort(m - 1, a);/*递归调用本身*/}int main(void){int n = 0, a[99], i;printf(Enter some numbers to be sorted:\n );printf(In Sorted order: );for (i = 0; i n; i++)printf(%d , a[i]);printf(\n);return 0;}do{scanf(%d, a[n]);n++;}while (getchar() != \n);selection_sort(n, a);第九章 编程题5/***********************用户输入数n后，调用函数创建幻方***********************/#includestdio.hvoid create_magic_square(int n, char magic_square[99][99]);void print_magic_square(int n, char magic_square[99][99]);int main(void){char magic_square[99][99] = { 0 };int size;printf(This program creates a magic square of a specified size.\n);printf(The size must be an odd number between 1 and 99.\n);printf(Enter size of magic square: );scanf(%d, size);create_magic_square(size, magic_square);print_magic_square(size, magic_square);return 0;}void create_magic_square(int n, char magic_square[99][99])/*此函数用1,2,…,n2填充数组*/{int middle, i, j = 0;middle = (n - 1) / 2;magic_square[j][middle] = 1;for (i = 2; i = n * n; i++){j--;middle++;if (j == -1)j = n - 1;if (middle == n)middle = 0;if (magic_square[j][middle] == 0)magic_square[j][middle] = i;else{if (j == n - 1 middle == 0){j = -1;middle = n;}else{if (j == n - 1)j == -1;if (middle == 0){middle = n - 1;j--;}}j = j + 2;middle--;magic_square[j][middle] = i;}}}void print_magic_square(int n, char magic_square[99][99]){int i,j;for (i = 0; i n; i++){for (j = 0; j n; j++)printf(%5d, magic_square[i][j]);printf(\n);}}第九章 编程题7/***************************测试递归运算计算多项式****************************/#includestdio.hint power(int x,int n);int main