js的链表排序_排序js

  sersort() {
                let p = this.head;
                let pp = p;
                let nunode = null;
                let ppr = p.next;
                while (pp.next != null) {
                    if (ppr.ser < pp.ser) {//如果后一个节点的ser小于前一个的ser那么将我们的节点进行交换
                        let arrive = 0, begin = 0; ser = 0; let turnover = 0, finish = 0, w = 0;
                        arrive = ppr.arrive;
                        begin = ppr.begin;
                        turnover = ppr.turnover;
                        finish = ppr.finish;
                        ser = ppr.ser;
                        w = ppr.w;
                        ppr.arrive = pp.arrive;
                        ppr.begin = pp.begin;
                        ppr.turnover = pp.turnover;
                        ppr.finish = pp.finish;
                        ppr.ser = pp.ser;
                        ppr.w = pp.w;
                        pp.arrive = arrive;
                        pp.begin = begin;
                        pp.turnover = turnover;
                        pp.finish = finish;
                        pp.ser = ser;
                        pp.w = w;
                    }
                    ppr = ppr.next;
                    pp = pp.next;
                }
            }