FilesExpand file tree

 master

/

binarySearch.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (26 loc) · 646 Bytes

 master

/

binarySearch.java

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (26 loc) · 646 Bytes

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

package org.study;

public class binarySearch {

public static void main(String[] args) {

int[] arr = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };

// 2 는 arr배열의 어떤 인덱스에 있을까?

binarySearch(2, arr);

}

private static void binarySearch(int key, int[] arr) {

int mid;

int left = 0;

int right = arr.length -1;

while (right >= left) {

mid = ( left + right) / 2;

if (arr[mid] == key) {

System.out.println(key +"는 arr배열의 "+mid+"에 있습니다");

break;

}

else if ( arr[mid] < key ) {

left = mid+1;

}

else if ( arr[mid] > key ) {

right = mid-1;

}

}

}

}