FilesExpand file tree

 master

/

binary_search.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (27 loc) · 1 KB

 master

/

binary_search.java

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (27 loc) · 1 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

import java.util.*;

public class Search {

static int indexOfItem(List<String> list, String target) {

int first = 0;

int last = list.size() - 1;

while (first <= last) {

int midpoint = (first + last) / 2;

int comparisonResult = list.get(midpoint).compareTo(target);

if (comparisonResult == 0) {

return midpoint;

} else if (comparisonResult < 0) {

first = midpoint + 1;

} else {

last = midpoint - 1;

}

}

// We have to return an integer, so return an "impossible"

// index to indicate value was not found.

return -1;

}

public static void main(String[] args) {

// Note that the list is sorted this time!

ArrayList<String> list = new ArrayList<String>(

Arrays.asList("Elida Sleight", "Francina Vigneault", "Lucie Hansman", "Nancie Rubalcaba"));

System.out.println(indexOfItem(list, "Lucie Hansman"));

}

}