찾기 (1) - 이분법 찾기

package com.BinarySearch;

import java.util.Arrays;

public class BS {

	public static void main(String[] args) {

          int[] a={14,8,547,69,321,45,7,21,3,2,0,14,85,625,9};
          Arrays.sort(a);
          for(int i=0;i<a.length;i++)
        	  System.out.print(a[i]+" ");
          System.out.println();
          binarySearch(a, 321, 0, a.length-1);
	}
	
	/**
	 *  
	 * @param data     
	 * @param target   
	 * @param l        
	 * @param r        
	 */
	public static void binarySearch(int[] data, int target,int l,int r){
				 
		 if(l<=r){
			 int center=(l+r)/2;
			 if(target<data[center])
				 binarySearch(data, target, l, center-1);
			 else if(target>data[center])
				 binarySearch(data, target, center+1, r);
			 else
				 System.out.println(" "+target+", ："+center);
		 }				
	}
}