二级题库（12）

void fun(NODE  *h)
{ NODE  *p, *q;    int  t;
/found/
  p = h->next ;
  while (p) {
/found/
     q = p->next ;
     while (q) {
/found/
        if (p->data > q->data)
        {  t = p->data;  p->data = q->data;  q->data = t;  }
        q = q->next;
    }
    p = p->next;
  }
}


int fun (NODE *h)
{ int max=-1;
  NODE *p;
/found/
  p=h->next;
  while(p)
       { if(p->data>max)
             max=p->data;
/found/
          p=p->next;
       }
  return max;
}


void fun (int (*s)[10], int *b, int *n, int mm, int nn)
{
	int i,j,k=0;
	for(i=0;i<mm;i++)
	for(j=0;j<nn;j++)
	b[k++]=s[i][j];
	*n=k;
}