//函数fun功能是将带头节点的单向链表结点域中的数据从小到大排序。
//相当于数组的冒泡排序。
#include <stdio.h>
#include <stdlib.h>
#define N 6
typedef struct node {
int data;
struct node *next;
} NODE;
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;
}
}
NODE *creatlist(int a[])
{ NODE *h,*p,*q; int i;
h = (NODE *)malloc(sizeof(NODE));
h->next = NULL;
for(i=; i<N; 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");
}
}
void main()
{ NODE *head;
int a[N]= {, , , , , };
head=creatlist(a);//创建链表
printf("\nThe original list:\n");
outlist(head);
fun(head);
printf("\nThe list after sorting :\n");
outlist(head);
}
//建立一个带头节点的单向链表，并用随机函数为各个结点数据域赋值，函数fun作用求出单向链表结点（不包括头节点）数据域中的最大值。
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
typedef struct aa
{ int data;
struct aa *next;
} NODE;
int fun (NODE *h)
{ int max=-;
NODE *p;
/*************found**************/
p=h->next;
while(p)
{ if(p->data>max)
max=p->data;
/*************found**************/
p=p->next;
}
return max;
}
void outresult(int s, FILE *pf)
{ fprintf(pf, "\nThe max in link :%d\n",s);
}
NODE *creatlink(int n, int m)
{ NODE *h,*p,*s;
int i;
h=p=(NODE *)malloc(sizeof(NODE));
h->data=;
for(i=;i<=n;i++)
{ s=(NODE *) malloc(sizeof(NODE));
s->data=rand()%m; s->next=p->next;
p->next=s; p=p->next;
}
p->next=NULL;
return h;
}
void outlink(NODE *h,FILE *pf)
{ NODE *p;
p=h->next;
fprintf(pf, "\n The LIST :\n\n HEAD");
while(p)
{ fprintf(pf, "->%d",p->data);
p=p->next;}
fprintf(pf, "\n");
}
void main()
{ NODE *head; int m;
system("CLS");
head=creatlink(,);//创建链表
outlink(head,stdout);
m=fun(head);
printf("\nThe RESULT :\n");
outresult(m,stdout);
}
//函数功能：将M*N的二维数组中的数据，按行依次放入一维数组，个数存储在形参n所指的存储单元。
#include <stdio.h>
void fun (int (*s)[], int *b, int *n, int mm, int nn)
{
int i=;
for (int m = ; m < mm; m++)
{
for (int n = ; n < nn; n++)
{
b[i++] = s[m][n];
}
}
*n = i;
}
void main()
{
FILE *wf;
int w[][]={{,,,},{,,,},{,,,}}, i, j;
int a[]={},n= ;
printf("The matrix:\n");
for (i=; i<; i++)
{for (j=;j<;j++)
printf("%3d",w[i][j]);
printf("\n");
}
fun(w,a,&n,,);
printf("The A array:\n");
for(i=; i<n; i++)
printf("%3d",a[i]);
printf("\n\n");
/******************************/
wf=fopen("out.dat","w");
for(i=; i<n; i++)
fprintf(wf,"%3d",a[i]);
fclose(wf);
/*****************************/
}