arraybub.java

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

package com.sort.bubble.demo;

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

	public ArrayBub(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 bubbleSort(){
		int out,in;
		for(out=nElems;out>1;out--){
			for(in=0;in<out-1;in++){
				if(a[in] > a[in+1]){
					swap(in,in+1);
				}
			}
		}
	}
	
	private void swap(int one,int two){
		long temp = a[one];
		a[one] = a[two];
		a[two] = temp;
		
	}
}