链表-G- 利用有序链表给数组排序

package e_link.G_listInsertionSort;


public class Link {
public int data;
public Link next;


public Link(int data) {
this.data = data;
}
}package e_link.G_listInsertionSort;


/**
 * 利用有序链表给数组排序
 * 
 * @author Administrator
 *
 */
public class ListInsertionSortApp {
public static void main(String[] args) {
int size = 10;
Link[] linkArr = new Link[size];
//创建Link数组并利用math赋10个值
for (int j = 0; j < size; j++) {
int n = (int) (Math.random() * 99);
Link newLink = new Link(n);
linkArr[j] = newLink;
}
//输出没排序的值
for (int i = 0; i < size; i++) {
System.out.print(linkArr[i].data + " ");
}
//创建对象并排序
SortedList s=new SortedList(linkArr);
//排序对象放入linkArr中
for (int i = 0; i < size; i++) {
linkArr[i] =s.remove();
}
System.out.println("------");
//输出
for (int i = 0; i < size; i++) {
System.out.print(linkArr[i].data + " ");
}

}
}package e_link.G_listInsertionSort;


public class SortedList {
private Link first;


public SortedList() {
first = null;
}


public SortedList(Link[] linkArr) {
first = null;
for (int j = 0; j < linkArr.length; j++) {
insert(linkArr[j]);
}
}


public void insert(Link link) {
Link previous = null;
Link current = first;
while (current != null && link.data > current.data) {
previous = current;
current = current.next;
}
if (previous == null)
first = link;
else
previous.next = link;
link.next = current;
}


public Link remove() {
Link temp = first;
first = first.next;
return temp;
}
}