一些算法

冒泡法

(public)void bubleSort(array[]){

 for(int i =array.length-1;i>0;i --)

  for(int j =0;j<array.length-i;j++){

   if(array[i]>array[i+!]){

    tem = array[i];

    array[i] = array[i+1];

    array[i+1] = tem;

}

}

}

贰分法

(public)int binarySearch(type array[],int n){

 int start = 0;

 int end = array.length-1;

 int num =(start+end)/2;

  while(start<=end)

{ if(n == array[num])return num;

 else if(n > array[num])start = num+1;

 else if(n < array[num])end = num -1;

 num =(start+end)/2;

}

 return -1

}