//把一个新数插入到一个有序的单链表中
//xwlee 2006/12/16
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define FALSE 0
#define TRUE 1
#define MY_MAX 100
typedef struct NODE{
struct NODE *link;
int value;
}node;
int sll_insert(register node **rootp, int new_value);
int main()
{
int i;
node *p, *p_origin;
srand( (unsigned)time( NULL ) );//随机产生数据
if( !( p = (node *)malloc(MY_MAX*sizeof(struct NODE)) ) )
exit(1);
p_origin=p;
//初始化有序数组
for(i=1; i<MY_MAX; ++i)
{
p->value = i*10;
p->link=p+1;
p++;
}
p->value=i*10;
p->link=NULL;//注意这里,结束链表
for(p=p_origin; p!=NULL; p=p->link)
printf("%-8d", p->value);
p=p_origin;
for(i=0; i<200; i++)
sll_insert( &p, rand()%1000);
printf("/n=======================after insert======================/n");
for(; p; p= p->link )
printf("%-8d", p->value);
printf("/n");
return 0;
}
//插入函数,效率不错
int sll_insert(register node **linkp, int new_value)
{
register node *current;
register node *newp;
while( (current=*linkp)!=NULL &&
(current->value) < new_value)
linkp=¤t->link;
if( !(newp=(node *)malloc( sizeof(node) ) ) )
return FALSE;
newp->value=new_value;
//在链表中插入新结点,返回TRUE
newp->link=current;
*linkp=newp;
return TRUE;
}
//xwlee 2006/12/16
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define FALSE 0
#define TRUE 1
#define MY_MAX 100
typedef struct NODE{
struct NODE *link;
int value;
}node;
int sll_insert(register node **rootp, int new_value);
int main()
{
int i;
node *p, *p_origin;
srand( (unsigned)time( NULL ) );//随机产生数据
if( !( p = (node *)malloc(MY_MAX*sizeof(struct NODE)) ) )
exit(1);
p_origin=p;
//初始化有序数组
for(i=1; i<MY_MAX; ++i)
{
p->value = i*10;
p->link=p+1;
p++;
}
p->value=i*10;
p->link=NULL;//注意这里,结束链表
for(p=p_origin; p!=NULL; p=p->link)
printf("%-8d", p->value);
p=p_origin;
for(i=0; i<200; i++)
sll_insert( &p, rand()%1000);
printf("/n=======================after insert======================/n");
for(; p; p= p->link )
printf("%-8d", p->value);
printf("/n");
return 0;
}
//插入函数,效率不错
int sll_insert(register node **linkp, int new_value)
{
register node *current;
register node *newp;
while( (current=*linkp)!=NULL &&
(current->value) < new_value)
linkp=¤t->link;
if( !(newp=(node *)malloc( sizeof(node) ) ) )
return FALSE;
newp->value=new_value;
//在链表中插入新结点,返回TRUE
newp->link=current;
*linkp=newp;
return TRUE;
}