Java实现数组的冒泡，选择，插入排序

【笔记】冒泡，选择，插入三者的排序算法时间复杂度均是O(N2)级，排序主要是执行比较和交换（复制）操作，相对来说：选择排序较冒泡排序减少了交换次数；
而插入排序左边是一直保持有序的。
【参考书籍】Java数据结构与算法

 以下是源代码，针对数组的操作，存取元素为基本类型：


  1 import java.util.Random;

class HighArray{
    private long[] array;
    private int nElems,i_mark;
    public HighArray(int max){
        array=new long[max];
        nElems=0;
    }
    public boolean find(long searchkey){
        for(i_mark=0;i_mark<nElems;i_mark++)
            if(array[i_mark]==searchkey)
                break;
        if(i_mark==nElems)
            return false;
        else
            return true;
    }
    public boolean binarySearch(long searchkey){
        int lowerBound=0;
        int highBound=nElems-1;
        int curIn=0;
        while(true){
            curIn=(highBound+lowerBound)/2;
            if(array[curIn]==searchkey)
                return true;
            else if(lowerBound>highBound)
                return false;
            else{
                for(int i=lowerBound;i<highBound;i++){
                    if(array[i]>searchkey)
                        highBound=curIn-1;
                    if(array[i]<searchkey)
                        lowerBound=curIn+1;
                }
            }
        }
    }//find :1~log^n+1
    public void insert(long value){
        array[nElems]=value;
        nElems++;
    }
    public void bubbleSort(){
        for(int i=0;i<nElems;i++)
            for(int j=0;j<nElems-1-i;j++)
                if(array[j]>array[j+1]){
                    swap(j,j+1);
                }
    }//sort:O(N*N)
    public void selectSort(){
        for(int i=0;i<nElems-1;i++)
            for(int j=i+1;j<nElems;j++)
                if(array[i]>array[j])
                    swap(i,j);
    }//sort:O(N*N),Relatively speaking,it's better than the bubbleSort,because the count of swap
    public void swap(int one,int two){
        long temp;
        temp=array[one];
        array[one]=array[two];
        array[two]=temp;
    }//sort:O(N*N)but better than before two
    
    public void insertSort(){
        int in;
        int out;
        long temp;
        for(out=nElems;out>0;out--){
            in=out;
            temp=array[in];
            while(in>0&&array[in-1]>temp){
                array[in]=array[in-1];
                in--;
            }
        }
    }
    public boolean delete(long value){
        if(find(value)){
            for(int k=i_mark;k<nElems-1;k++)
                array[k]=array[k+1];
            nElems--;
            return true;
        }
        else
            return false;
    }
    public void display(){
        for(int j=0;j<nElems;j++)
            System.out.println("array["+j+"] = "+array[j]);
    }
}

public class ArrayQuery{
    
    public static void main(String[] args){
        boolean flag=false;
        int max=1000;
        HighArray harr=new HighArray(max);
        for(int j=0;j<max-1;j++)
            harr.insert(new Random().nextInt(max));
        harr.display();
        if(harr.find(13))
            System.out.println("we find it: ");
        else
            System.out.println("there is no:");
        if(harr.delete(15)){
            System.out.println("delete success:");
            harr.display();
        }
        else{
            System.out.println("delete fail:");    
            harr.display();
        }
        long a,b;
        a = System.nanoTime();;    
        harr.bubbleSort();
        b = System.nanoTime();; 
        System.out.println("bubbleSort result:time = "+(b-a)+"ns.");
        //harr.display();
        
        
        a = System.nanoTime();
        harr.selectSort();
        b = System.nanoTime();
        System.out.println("selectSort result:time = "+(b-a)+"ns.");
        //harr.display();
        
        a = System.nanoTime();
        harr.insertSort();
        b = System.nanoTime();
        System.out.println("insertSort result:time = "+(b-a)+"ns.");
        //harr.display();
    }
}