03. 검색 연습문제 Q3 static int searchIdx(int[] a, int n, int key, int[] idx) { int count = 0; for(int i=0; i"); }else{ System.out.printf("%2s",""); } } System.out.print("\n"+idx+" |"); for(int j=0; j key) { end = idx -1; }else{ first = idx + 1; } System.out.println("\n |"); } return -1; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("배열 크기 ::: "); int..