单链表的查找程序

精品文档---下载后可任意编辑单链表的查找，程序如下：#include#include#includetypedef struct node { int data; struct node *next; }LinkList; LinkList *CreateList(int length) { LinkList *head,*p,*q; head=(LinkList*)malloc(sizeof(node)); head->next =NULL; q=head; printf("******请输入链表中的%d 个元素:\n",length); for(int i=1;inext=p; p->next=NULL; q=q->next ; scanf("%d",&p->data); } return head;}void select_insert(LinkList *head) { int min=0; int tmp=0; 精品文档---下载后可任意编辑 LinkList *p,*q,*M; p=q=M=head; while(p->next

=NULL) { M=q=p->next; min=q->data; while(q

=NULL) { if(q->datadata; } q=q->next; } if(p->next

=M) { tmp=p->next->data; p->next->data=M->data; M->data=tmp; } p=p->next; } } locate(LinkList *head,int key) { int k=1; LinkList *p; p=head->next; while((p

=NULL) && (p->data

=key))精品文档---下载后可任意编辑 { p=p->next; k++; } if(p==NULL