sort.java

简单的Java作业

package Squall;
import java.util.*;

abstract public class SORT
{
	//private int ex = 0;
//	private int co = 0;
	//private int mo = 0;
	private CACULATE ex = new CACULATE();
	private CACULATE co = new CACULATE();
	private CACULATE mo = new CACULATE();
	static Vector vec = new Vector();

	abstract public void dosort(Vector temp);
	
	final public void exchange(Vector temp,int a,int b)
	{
		type tem = new type(0);
		//ex.cal++;
		ex.cal = ex.plusone(ex.cal);
		tem.ty = ((type)temp.get(a)).ty;
		//tem.ty = Integer(temp.get(a));
		//temp.get(a) = temp.get(b);
		//temp.get(b) = tem.ty;
		((type)temp.get(a)).ty = ((type)temp.get(b)).ty;
		((type)temp.get(b)).ty = tem.ty;
	}
	
	final public boolean compare(type a,type b)
	{
		//co++;
		co.cal = co.plusone(co.cal);
		if(a.ty > b.ty)
			return true;
		else
			return false;
	}
	
	final public int move(type a,type b)
	{
		//mo++;
		mo.cal = mo.plusone(mo.cal);
		a.ty = b.ty;
		return a.ty;
	}
	
	public void getin(Vector v)
	{
		vec = v;
	}
	
	public Vector getout()
	{
		return vec;
	}
	
	public void display(Vector temp,long time)
	{
		System.out.println("需要时间："+time+"毫秒");
		System.out.println("交换次数："+ex.cal+"次");
		System.out.println("比较次数："+co.cal+"次");
		System.out.println("移动次数："+mo.cal+"次");
		for(int i=0;i < temp.size();i++)
		{
			System.out.print(((type)temp.get(i)).ty+" ");
		}
		System.out.print("\n");
	}
}