compositor.java

package query public class LinkQuery { private Node front private Node vear public Link

package paixu;

public class Compositor {
	private int maxSize;
	private int size;
	private int index;
	private int a[];
	public Compositor(int maxSize)
	{
	this.maxSize=maxSize;
	this.size=0;
	this.index=-1;
	a=new int[this.maxSize];
	}
	

	public boolean isEmpty()
	{
		return this.size==0;
	}
	public boolean isFull()
	{
	return this.size==maxSize;
	}
	public void addCount(int i)
	{
		if(this.isFull())
		{
			System.out.println("线性表已满");
			return;
		}
		this.a[++index]=i;
		size++;
	}
	//对数组选择排序
	public void choice()
	{
		for (int i = 0; i <this.size-1; i++)
		{
				int count=i;
			for (int j = i+1; j < this.size; j++) 
			{
				if(a[count]>a[j])
				count=j;
			}	
			if(count!=i)
			{
				int temp=this.a[count];
				this.a[count]=this.a[i];
				this.a[i]=temp;
			}
		}
	}
	//对数组冒泡排序

	public void maopao()
	{
	for (int i = 0; i < this.size-1; i++)
	{
		boolean flag=false;
		for (int j = 0; j <this.size-1-i; j++)
		{
			if(this.a[j]>this.a[j+1])
			{
				int temp=a[j];
				a[j]=a[j+1];
				a[j+1]=temp;
				flag=true;
			}
		}
		if(flag==false)
		
			break;
		
	}
	}
	//插入法排序
	public void  insert()
	{
		for (int i= 0 ; i <this.size; i++)
		{
		int temp=a[i];
		int index=i;
		while(index>0&&temp<this.a[index-1])
		{
			a[index]=a[index-1];
		    index--;
		}
		a[index]=temp;
		}
		
		
	}
	public  void print()
	{
		for (int i = 0; i < this.size; i++) 
		{
		System.out.println(this.a[i]);	
		}
	}
	public static void main(String[] args)
	{
	int number[]={1,100,266,300,500,-999,999,888,2,3,5};
	Compositor com=new Compositor(number.length);
	for (int i = 0; i < number.length; i++) {
		com.addCount(number[i]);
	}
	//com.choice();
	//com.maopaoCompositor();
	//com.maopao();
	com.insert();
	com.print();

	
	}
	

}