integersorttest.java

来自「设计一个由自动测试排序算法性能（比较次数compare_count、交换次数ex」· Java 代码 · 共 74 行

package integerSortTest;
import mySort.Sort;
//测试类
public class IntegerSortTest
{
	private int compare_count=0;
	private int exchange_count=0;
	private int move_count=0;
	private int probe_count=0;
	public int compare(int i,int j)
	{
		if(Sort.Array[i]>Sort.Array[j])
		{
			i=j;
			compare_count++;
		}
		return i;
	}
	public void exchange(int i,int j)
	{
		if(i!=j)
		{
				int temp;
				temp=Sort.Array[i];
				Sort.Array[i]=Sort.Array[j];
				Sort.Array[j]=temp;
				compare_count++;
				exchange_count=exchange_count+3;
		}
	}
	public void move(int i,int x)
	{
		while((i>0)&&(Sort.Array[i]>x))
		{
				Sort.Array[i+1]=Sort.Array[i];
				i--;
				compare_count++;
				move_count++;
		}
		Sort.Array[i+1]=x;
		move_count++;
	}
	public boolean exchange(int i,boolean flag)
	{
		if(Sort.Array[i]<Sort.Array[i-1])
	  {
	  	int temp;
	  	temp=Sort.Array[i];
	  	Sort.Array[i]=Sort.Array[i-1];
	  	Sort.Array[i-1]=temp;
	  	flag=false;
	  	compare_count++;
	  	exchange_count=exchange_count+3;
	  }
	  return flag;
	}
	public int countCompare()
	{
		return compare_count;
	}
	public int countExchange()
	{
		return exchange_count;
	}
	public int countMove()
	{
		return move_count;
	}
	public int countProbe()
	{
		probe_count=compare_count+exchange_count+move_count;
		return probe_count;
	}
}