9月上机填空题
1
#include
#include
#define N 6
typedef struct node {
int data;
struct node *next;
} NODE;
void fun(NODE *h)
{ NODE *p, *q; int t;
/**********found**********/
p = __1__ ; h->next /*因为是带有头节点，头节点不存内容所
以，不取头节点*/
while (p) {
/**********found**********/
q = __2__ ; p->next /*从p指向的下个节点开始比较*/
while (q) {
/**********found**********/
if (p->data __3__ q->data) >
{ t = p->data; p->data = q->data; q->data = t; }
q = q->next;
}
p = p->next;
}
}
NODE *creatlist(int a[])
{ NODE *h,*p,*q; int i;
h = (NODE *)malloc(sizeof(NODE));
h->next = NULL;
for(i=0; i
{ q=(NODE *)malloc(sizeof(NODE));
q->data=a[i];
q->next = NULL;
if (h->next == NULL) h->next = p = q;
else { p->next = q; p = q; }
}
return h;
}
void outlist(NODE *h)
{ NODE *p;
p = h->next;
if (p==NULL) printf("The list is NULL!\n");
else
{ printf("\nHead ");
do
{ printf("->%d", p->data); p=p->next; }
while(p!=NULL);
printf("->End\n");
}
}
main()
{ NODE *head;
int a[N]= {0, 10, 4, 2, 8, 6 };
head=creatlist(a);
printf("\nThe original list:\n");
outlist(head);
fun(head);
printf("\nThe list after sorting :\n");
outlist(head);
}
2
#include
#define M 3
#define N 4
void fun(int (*a)[N])
{ int i=0,j,find=0,rmax,c,k;
while( (i
{ rmax=a[i][0]; c=0;
for(j=1; j
if(rmax
/**********found**********/
rmax=a[i][j]; c= __1__ ; } j /*下面看出c作为列号，所以c=j*/
find=1; k=0;
while(k
/**********found**********/
if (k!=i && a[k][c]<=rmax) find= __2__ ; 0 /* find 作为标志 ，值只能是1 or 0 ，此处之前find =1 ,所以现在改变为0*/
k++;
}
if(find) printf("find: a[%d][%d]=%d\n",i,c,a[i][c]);
/**********found**********/
__3__ ;
