链表的创建，打印，测长，删除，排序

#include <stdio.h>
#include<stdlib.h>
typedef struct student
{
 int data;
 struct student *next;
}node;
node *creat()
{
 node *head,*p,*s;
 int x,cycle=1;
 head=(node*)malloc(sizeof(node));
 p=head;
 while(cycle)
 {
  printf("\nplease input the data:");
  scanf("%d",&x);
  if(x!=0)
  {
  

   s=(node*)malloc(sizeof(node));
   s->data=x;
  // printf("\n%d",s->data);
   p->next=s;
   p=s;
  }
  else cycle=0;
 }
 head=head->next;
 p->next=NULL;
// printf("\n%d",head->data);
 return (head);
}
void print(node *head)
{
 node *p;
 p=head;

 if(head!=NULL)
 while(p!=NULL)
 {
  printf("\n%d",p->data);
  p=p->next;
 }
 printf("\n");
}
int length(node *head)
{
 int n=0;
 node *p;
 p=head;
 while(p!=NULL)
 {
  n++;
  p=p->next;
 }
 return n;
}
node *del(node *head,int num)
{
 node *p1,*p2;
 p1=head;
 while(p1->data!=num&&p1->next!=NULL)
 {
  p2=p1;
  p1=p1->next;
 }
 if(num==p1->data)
 {
  if(p1==head)
  {
   head=p1->next;
   free(p1);
  }
  else p2->next=p1->next;
 }
 else printf("\n %d could not been found",num);
 return (head);
}
node *sort(node *head)
{
 node *p;
 int n,temp;
 n=length(head);
 if(head==NULL||head->next==NULL)
 return head;
 p=head;
 for(int j=1;j<n;j++)
 {
  p=head;
  for(int i=0;i<n-j;i++)
  {
   if(p->data>p->next->data)
   {
    temp=p->data;
    p->data=p->next->data;
    p->next->data=temp;
    
   }
   p=p->next;
  }
  
 }
 return head;
}
int main(int argc, char *argv[])
{
 node *head;
 head=creat();
 print(head);
 
 printf("the list length is %d",length(head));
 del(head,7);
 printf("\nthe del later num is:");
 print(head);
 printf("\n the sort later num is:");
 sort(head);
 print(head);
 return 0;
}