package cn.xf.algorithm.ch04;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import org.junit.Test;

public class QuikSort {
	
	public int hoarePartition(List data, int left, int right) {
		//当要比对的数据相差为1的时候，表示就只有一条数据要进行比较了
		if(data =http://www.mamicode.com/= null || right - left <= 1 || left >= right) {"\t");
		}
	}
	
	public static void test1(List data) {
		data = http://www.mamicode.com/null;"1", "2", "3", "4", "5", "6");
		QuikSort.test1(data);
		for(Object j : data) {
			System.out.println(j);
		}
	}
}