程序员首页投稿(暂停使用,暂停投稿)

C_language_renew08

2017-12-18  本文已影响13人  遮天的龙

链表



code:

  Node * createList()
   {
          Node *head =(Node*)malloc(sizeof(Node));
          head->next = NULL;
          Node*cur = NULL;
          int tmp;
          while(1)
          {
               scanf("%d",&tmp);
                if(tmp == 1)
                 {
                      break;
                 }
                 cur = (Node*) malloc(sizeof(Node));
                 cur->data = tmp;
                 cur->next = head->next;
                 head->next = cur;
          }
          return head;
    }

code:

    void sortPtr(Node* head ,int len)
    {
          Node * tmp;
          Node * hs;
          Node * p, *q;
          
          for(int i = 0;i < len - 1; i++)
          {
                hs = head;
                p = hs-> next;
                q = p->next;
                for(int j = 0; j < len-1-i;j++)
                {
                      if(p->data  > q->data)
                      {
                           hs->next = p->next;
                           p->next = q->next;
                            
                           q->next = p;
                            tmp = p;
                            p =q;
                            q = tmp;
                      }
                      hs = hs->next;
                      p = p->next;
                      q = q->next;
                }
          }
        return ;
    }
上一篇 下一篇

猜你喜欢

热点阅读