单链表的基本操作二——排序 （java）

单链表的基本操作二——排序

快排 & 插入排序

class Sort{
	/**
	 * 单链表的快速排序
	 */
	public static void quickSort(Node head,Node end) {
		if (head != end) {
			Node node = part(head, end);
	        quickSort(head, node);
	        quickSort(node.getNext(), end);
	    }
	}
	
	public static Node part(Node head,Node end) {
		System.out.println((head == null?null:head.getData()) + "----" + (end == null?null:end.getData()));
		Node p1 =  head, p2 = head.getNext();
		
		while(p2 != end) {
			
			if (p2.getData() < head.getData()) {
				p1 = p1.getNext();
				if (p1 != p2) {
					int tmp = p1.getData();
					p1.setData(p2.getData());
					p2.setData(tmp);
				}
			}
			p2 = p2.getNext();
			
		}
		
		if (p1 != head) {
			int tmp = head.getData();
			head.setData(p1.getData());
			p1.setData(tmp);
		}
		return p1;
	}
	
	/**
	 * 单链表的插入排序
	 */
	public static Node insertSort(Node head) {
		if(head == null || head.getNext() == null) return head;
		
		Node p1 = head.getNext();
		Node p = head;
		Node tmp = new Node(-999); //始终指向头节点
		tmp.setNext(head);
		
		while (p1 != null) {
			
			if (p.getData() > p1.getData()) {
				
				p.setNext(p1.getNext()); //删除 p1节点
				
				Node tmp1 = tmp;//tmp1指向头结点
				Node tmp2 = tmp.getNext();
				while(tmp2.getData() < p1.getData()) { //和p1做比较，便于找到p1的合适位置
					
					tmp1=tmp2;
					tmp2 = tmp2.getNext();
				}
				// tmp1 < p1 < tmp2  所以把p1放到tmp1 和tmp2之间
				tmp1.setNext(p1);
				p1.setNext(tmp2);
				
				//移动指针，处理下一个节点
				p1 = p.getNext();
				
			}else {
				p = p1;
				p1 = p1.getNext();
			}
		}
		System.out.println(tmp.getNext().getData());
		return tmp.getNext(); //返回头结点
	}
	
	public static void main(String[] args) {
		LinkList list = new LinkList();
		Node n1 = new Node(4);
		Node n2 = new Node(2);
		Node n3 = new Node(5);
		Node n4 = new Node(3);
		Node n5 = new Node(7);
		Node n6 = new Node(9);
		Node n7 = new Node(0);
		Node n8 = new Node(1);
		n1.setNext(n2); n2.setNext(n3); n3.setNext(n4); n4.setNext(n5); n5.setNext(n6); n6.setNext(n7); n7.setNext(n8);
		System.out.println("排序前");
		list.printList(n1);
		System.out.println("排序后");
//		quickSort(n1, null);  快排
		
		list.printList(insertSort(n1));
	}
	
}