How to perform binary search on sort Array in Java

2 Answers

0 votes
package javaapplication1;

import java.util.Arrays;

public class JavaApplication1 {

    public static void main(String[] args) {

        short shortArr[] = {6, 4, 2, 3, 1, 2, 7, 5, 8};
   
        Arrays.sort(shortArr);

        short sn = 5;
        int r = Arrays.binarySearch(shortArr, sn);
        System.out.println("return index : " + r);
    }
}
 
/*

run:

return index : 5

*/

 



answered Oct 5, 2016 by avibootz
0 votes
package javaapplication1;

import java.util.Arrays;

public class JavaApplication1 {

    public static void main(String[] args) {

        short shortArr[] = {6, 4, 2, 3, 1, 2, 7, 5, 8};
   
        Arrays.sort(shortArr);

        short sn = 9;
        int r = Arrays.binarySearch(shortArr, sn);
        System.out.println("return index : " + r);
        
        r = Arrays.binarySearch(shortArr, (short)11);
        System.out.println("return index : " + r);
        
        sn = -12;
        r = Arrays.binarySearch(shortArr, sn);
        System.out.println("return index : " + r);        
        
        sn = -2;
        r = Arrays.binarySearch(shortArr, sn);
        System.out.println("return index : " + r);        
    }
}
 
/*

run:

return index : -10
return index : -10
return index : -1
return index : -1

*/

 



answered Oct 5, 2016 by avibootz

Related questions

2 answers 216 views
3 answers 231 views
2 answers 211 views
2 answers 168 views
2 answers 198 views
3 answers 198 views
1 answer 187 views
...