Method lower_bound

Codechef/Java/TheWave.java:19–36

(long arr[], long N, long X)

    //If number of elements greater than root are even then output will be POSITIVE
    //If anyone element is equal to root output will be zero
    public static long lower_bound(long arr[], long N, long X)
    {
        long mid;
        long low = 0;
        long high = N;
        while (low < high) 
        {
            mid = low + (high - low) / 2;
            if (X <= arr[(int)mid]) 
                high = mid;
            else 
                low = mid + 1;
        }
        if(low < N && arr[(int)low] < X) {
        low++;
    }
    return low;
}
   //Main function
    public static void main (String[] args) throws java.lang.Exception
    {