Binary lookup array subscript

Find array subscript , Indexes , Two points

Binary lookup array , Arrays must be ordered

In order from small to large

import java.util.Arrays;
public class ErFentest {
    
    public static void main(String[] args) {
    
        // Binary lookup array ,, Arrays must be sorted from small to large 
        int index = f(4);// look for 14 The index of 
        System.out.println(index);// Print 14 The index of 
    }
    public static int f(int args) {
    
        int[] a = {
    1,4,8,12,20,24};
        int s = 0;// Start index 
        int e = a.length - 1;// End index 
        while (s <= e) {
    
            int m = (s + e) / 2;// Take the middle number index 
            if (a[m] == args) {
    
                return m;// Return the index of the number 
            } else if (a[m] > args) {
    
                e = m - 1;
            } else {
    
                s = m + 1;
            }

        }
        return -1;// Not returning -1

    }
}