FilesExpand file tree

 master

/

BinSearch.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (41 loc) · 1.14 KB

 master

/

BinSearch.java

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (41 loc) · 1.14 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

package org.doit;

import java.util.Scanner;

public class BinSearch {

static int binSearch(int[] a, int n, int key) {

int pl = 0; // 검색 범위의 첫 인덱스

int pr = n - 1; // 검색 범위의 끝 인덱스

do {

int pc = ( pl + pr ) / 2;

if (a[pc] == key)

return pc; // 검색성공

else if (a[pc] < key)

pl = pc + 1;

else

pr = pc - 1;

} while (pl <= pr);

return -1; // 검색실패

}

public static void main(String[] args) {

Scanner std = new Scanner(System.in);

System.out.println("요솟수 : ");

int num = std.nextInt();

int[] x = new int[num];

System.out.println("오름차순으로 입력하세요 ");

System.out.print("x[0] = ");

x[0] = std.nextInt();

//-- 바로 전 요소 보다 작으면 다시 입력

for (int i=1; i<num; i++) {

do {

System.out.print("x[" + i + "] = ");

x[i] = std.nextInt();

} while( x[i-1] > x[i]);

}

System.out.print("검색할 값 : ");

int ky = std.nextInt();

int idx = binSearch(x, num, ky);

if(idx == -1)

System.out.println("해당값을 찾지 못했습니다.");

else

System.out.println("x["+idx+"]에 있습니다.");

}

}