数据结构：链表 >> 链表按结点中第j个数据属性排序(冒泡排序法)

创建结点类，链表类，测试类

public class TestList {
public static void main(String[] arg){
Node n0=new Node(125,"n0","91");
Node n1=new Node(123,"n1","98");
Node n2=new Node(121,"n2","99");
Node n3=new Node(125,"n3","96");
Node n4=new Node(125,"n4","95");
Node n5=new Node(125,"n5","97");
Node n6=new Node(125,"n6","93");
Node n7=new Node(125,"n7","94");
Node n8=new Node(125,"n8","92");
Node n9=new Node(125,"n9","90");

List f1=new List("f1List");
//头插法
f1.appendToFront(n0).appendToFront(n1).appendToFront(n2).appendToFront(n3)
.appendToFront(n4).appendToFront(n5).appendToFront(n6).appendToFront(n7)
.appendToFront(n8).appendToFront(n9);

//拿到排好序的链表f2;
f1.listSort(3).visitAll();

}

}

View Code
冒泡排序用处真大

心得：

>>对于指针（引用）的运用需要注意如下：

Node p=f1List.head;

p=p.next;//让指针直接指向（即直接p=）新引用对象（p.next），不会引起原被引用对象（head）的任何变化

Node p=f1List.head;
p.next=p;//调用原被引用对象的属性后，将会引起原被引用对象（head）的属性相应的变化