FilesExpand file tree

 master

/

BinarySearchRange.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (32 loc) · 821 Bytes

 master

/

BinarySearchRange.java

Copy path

Top

File metadata and controls

• Code
• Blame

46 lines (32 loc) · 821 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

34

35

36

37

38

39

40

41

42

43

44

45

46

package test1;

public class BinarySearchRange {

public static void main(String[] args) {

int [] a = {5, 7, 7, 8, 8, 10};

int found = search(a,10,0,a.length-1);

System.out.println("found at pos: "+found);

if (found<0)

return;

int left=found-1;

int right=found+1;

while(left > 0 && a[found]==a[left])

left--;

while(right < a.length && a[found]==a[right])

right++;

System.out.println("start: " + (left+1));

System.out.println("end: " + (right-1));

}

public static int search(int[] n, int k, int start, int end) {

int mid = (start+end)/2;

if (n[mid]==k)

return mid;

if ( mid - 1 < start || mid + 1 > end)

return -1;

if (k>n[mid]) {

return search(n,k,mid+1,end);

}

if (k<n[mid]) {

return search(n,k,start,mid-1);

}

return -1;

}

}