书面作业_13.doc

书面作业_13:1. 在主函数中定义一个5 行50列的字符数组，然后调用两个函数进行处理：(1)void dubble_sort(char(*p)50,int n)：对字符串进行冒泡排序(从小到大)；(2)void print(char(*p)50,int n)：输出排序后的字符串；程序运行如下图所示，请编程实现：#include#includeint main( ) void dubble_sort (char(*p)50,int m);void print(char(*p)50,int n);int i;char (*p)50;char name550=Follow me-,BasicStudy,Great Wall,FORTRAN-,computer-;p=name;printf(before sorted:n-n);for(i=0; i5; i+) puts(namei);dubble_sort (p,5);print(p,5);return 0;void dubble_sort (char(*p)50,int m)char temp50;int i,j;for(i=0; i4; i+)for(j=0; j0)strcpy(temp, pj);strcpy(pj, pj+1);strcpy(pj+1, temp);void print(char(*p)50,int n)int i;printf(nafter sorted:n-n);for(i=0; i5; i+) puts(pi);2. 假若各字符串的长度不相等，则需要用字符指针数组来存储各字符串的地址，实现上一题类似功能，所用的两个函数是：(1)void dubble_sort(char *p,int n)：对字符串进行冒泡排序(从小到大)；(2)void print(char *p,int n)：输出排序后的字符串；请修改程序。#include#includeint main( ) void dubble_sort (char *p,int m);void print(char *p,int n);int i;char *p=Follow me-,BasicStudy,Great Wall,FORTRAN-,computer-;printf(before sorted:n-n);for(i=0; i5; i+) puts(pi);dubble_sort (p,5);print(p,5);return 0;void dubble_sort (char *p,int m)char *temp;int i,j;for(i=0; i4; i+)for(j=0; j0)temp=pj;pj=pj+1;pj+1=temp;void print(char *p,int n)int i;printf(nafter sorted:n-n);for(i=0; i5; i+) puts(pi);3 编写函数，从二维整型数组arraymN中查找最大值元素，由指针参数prow 和pcol 带回该元素的行号、列号的指针。函数原型：void Max_pos(int arrayN, int m, int * prow, int * pcol);#include #include #include #define N 20#define M 10void Max_pos(int arrayM, int n, int *prow, int *pcol) int i,j,max = array00;for(i = 0; i n; +i) for(j = 0;j max) max = arrayij;*prow = i;*pcol = j;void ReadDat(int aM,int n) int i,j;for(i = 0;i n;i+) for(j = 0; j M; +j) aij = (unsigned)rand()%51 + 50;void WriteDat(int aM,int n) int i,j; for(i = 0;i n; i+) for(j = 0 ; j M; +j)printf(%5d,aij);printf(n);int main(int argc,char *argv) /主函数簓，?调獭用?以?上?函数簓int aNM,prow,pcol;srand(unsigned)time(NULL);Read