test.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 65 行

/*
 * Copyright (C) 2000-2007 Wang Pengcheng <[e-mail]>
 * Licensed to the Wang Pengcheng under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The LGPL licenses this file to You under the GNU Lesser General Public
 * Licence, Version 2.0  (the "License"); you may not use this file except in
 * compliance with the License.  You may obtain a copy of the License at
 *
 *     http://www.gnu.org/licenses/lgpl.txt
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
//8 Oct 2007
package cn.edu.whu.iss.algorithm.unit07;

import mypackage.tools.print.P;

public class Test {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		P.rintln("Quick sort simple");
		Integer[] a = {8,8,6,6,5,4,3,2,1};
		P.rintln(a);

		QuickSort.sort(a);
		P.rintln(a);
		
		P.rintln("Quick sort randomized");
		Integer[] b = {8,8,6,6,5,4,3,2,1};
		P.rintln(b);

		QuickSort.randomizedSort(b);
		P.rintln(b);
		
		P.rintln("Quick sort hoare");
		Integer[] c = {8,8,6,6,5,4,3,2,1};
		P.rintln(c);

		QuickSort.hoareSort(c);
		P.rintln(c);
		
		P.rintln("sort Stooge");
		Integer[] d = {8,8,6,6,5,4,3,2,1};
		P.rintln(d);

		StoogeSort.sort(d);
		P.rintln(d);
		
		P.rintln("sort quick-select");
		Integer[] e = {8,8,6,6,5,4,3,2,1};
		P.rintln(e);
		QuickSort.selectSort(e);
		P.rintln(e);
	}

}