소스 구현 (정렬된 수에서 32를 찾기) package org.kyhslam.algo; public class binarySearch { static int a[] = {12,23,32,57,65,81,89,99}; public static void main(String[] args) { viewArray(a); int target = 32; System.out.println(); binary(target); } //반복문 static public void binary(int target){ int left = 0; int right= a.length-1; // 7 while(left target){ right = mid -1; }else if(a[mid] < target){ left = mid +1; ..