Java version of the binary algorithm implementation

Algorithm class ERFENFA


{


int[] iarray={1,5,9,14,27,39,41,50,62,222,345,612,981,1207,8721}; Looking for
in this sequence of numbers

int iseek=345; Search 345 of Locations


int icount=0; Number of comparisons





public int Xunhuan ()


//Common cycle method, need to compare at least once, such as looking for 1, the maximum need to compare 15 times, such as 8721


{


for (int i=0;i<iarray.length;i++)


{


icount++;


if (Iseek==iarray[i])


break;


}


return icount;


}





public int Erfen ()


//Two-way search


{


int iindex=0; The equivalent of a pointer to something


int istart=0; //


int iend=iarray.length-1;


while (true)


{


icount++;


Iindex = (istart+iend)/2;


if (iarray[iindex]<iseek)


{


IStart = Iindex;


}


else if (Iarray[iindex]>iseek)


{


iend = Iindex;


}


Else


{


break;


}


}


return icount;


}





public static void Main (string[] args)


{


Erfenfa eff=new Erfenfa ();


Erfenfa eff1=new Erfenfa ();


System.out.println ("Common cycle lookup, the number of times to compare:" +eff.xunhuan ());


System.out.println ("binary search, the number of times to compare:" +eff1.erfen ());


}


}