Binary Search Algorithm Java Real-Time Representation (original article: http://www.oschina.net/code/snippet_107039_5818)

Package search;/*** @ author Lei 2011-8-17 */public class binarysearch {/*** Binary Search ** note: binary Search only targets arrays or collections in an ordered manner ** @ Param target * @ Param array * @ return */static Boolean binarysearch (INT target, int [] array) {int front = 0; int tail = array. length-1; // determine whether the Sub-array can be split into two parts again while (front <= tail) {// obtain the middle position of the sub-array, perform binary int middle = (front + tail)/2 based on the intermediate position; if (array [Middle] = target) {return true ;} else if (array [Middle]> Target) {tail = middle-1 ;}else {front = middle + 1 ;}} return false ;} public static void main (string [] ARGs) {int [] array = new int [] {1, 2, 3, 5, 7, 9, 17,121,454 5}; system. out. println (binarysearch (4545, array ));}}