#include<stdio.h>
#include<stdlib.h>
# include<iostream>
using namespace std;
typedef struct node
{
int data;
struct node *next;

{
}

p->data=value;
while(t->next!=NULL) //当链表不为空时t向后移动
t=t->next;
t->next=p;
p->next=NULL;
}

{
while(p->next!=NULL) //
{

if(p->next->data>value)
{
s->data = value;
s->next = p->next;
p->next=s;
}
else
p=p->next;
}

}

{
while(p->next!=NULL)
{
if(p->next->data==value)
{
t=p->next;
p->next=t->next;
free(t);
t=NULL;
}
else
p=p->next;
}
}

{
while(p->next!=NULL)
{

if(p->next->data==value)
{
t->next=p->next;

}
else
t=p;
p=p->next;
}
}

{
if(p==NULL)
{
}
while(p!=NULL)
{
printf("%3d",p->data);
p=p->next;
}
printf("\n");
}

{
int i,j,t;
int n=0;
while(p!=NULL)
{
n++;
p=p->next;
}
for(i=0;i<n-1;i++) //冒泡排序
{
q=p->next;
for(j=0;j<n-i-1;j++)
{
if(p->data > q->data)
{
t=p->data;
p->data=q->data;
q->data=t;
}
p=p->next;
q=q->next;
}
}
}

int main()

{

int i, j,num;
printf("tail_insert:\n");
//	for(i=2;i<20;i=i+4)
int a[5] = {1, 2, 4, 3, 6};
for(j=0;j<5;j++)
{
i=a[j];
}

printf("pop sort:\n");

printf("insert:\n");

printf("delet:\n");

printf("delet_before:\n");