Data structure and algorithm learning (III.)

Whole table of single linked list * Create *: The idea is to create an empty table before inserting.

Head Interpolation method:

Void Createlisthead (linklist *l,int N)

{linklist p;

int i;

(*l)->next=null;

Srand (Time (0));//initialization of random numbers

*l= (linklist) malloc (sizeof (Node));

for (i=1;i<=n;i++)

{p= (linklist) malloc (sizeof (Node));

P->data=rand ()%100+1;//rand range is 0-99, note modulo,%100 get two digits +1 range 1-100

p->next= (*l)->next;

(*l)->next=p;

}

}

Tail interpolation method:

Void Createlisttail (linklist *l,int N)

{linklist p,r;//one more R variable

int i;

(*l) = (linklist) malloc (sizeof (Node));

R= (*L);

Srand (Time (0));//initialization of random numbers

for (i=0;i<n;i++)

{p= (linklist) malloc (sizeof (Node));

P->data=rand ()%100+1;

r->next=p;

R=p;}

}

Data structure and algorithm learning (III.)