arraysel.java

数据结构和算法一些demo 包括冒泡排序,选择排序

package com.sort.select.demo;

public class ArraySel {
	private long[] a;
	private int nElems;

	public ArraySel(int max){
		a = new long[max];
		nElems = 0;
	}
	
	public void insert(long value){
		a[nElems] = value;
		nElems++;
	}
	
	public void display(){
		for(int i=0;i<nElems;i++){
			System.out.println("------------>" + a[i]);
		}
	}
	
	/**
	 * 选择排序
	 */
	public void selectSort(){
		int out,in,min;
		for(out=0;out<nElems-1;out++){
			min = out;
			for(in=out+1;in<nElems;in++){
				if(a[in] < a[min]){
					min = in;
				} //end if
			}	//end in
			swap(out,min);
		} //end out
	}
	
	private void swap(int one,int two){
		long temp = a[one];
		a[one] = a[two];
		a[two] = temp;
	}
}