Floor in a Sorted Array Java

PROGRAM TO FIND THE LARGEST ELEMENT IN ARRAY SMALLER THAN OR EQUAL TO GIVEN NUMBER

import java.io.*;

  

class Main {

  

    /* Function to get index of floor of x in

    arr[low..high] */

    static int floorSearch(

        int arr[], int low,

        int high, int x)

    {

        // If low and high cross each other

        if (low > high)

            return -1;

  

        // If last element is smaller than x

        if (x >= arr[high])

            return high;

  

        // Find the middle point

        int mid = (low + high) / 2;

  

        // If middle point is floor.

        if (arr[mid] == x)

            return mid;

  

        // If x lies between mid-1 and mid

        if (

            mid > 0 && arr[mid - 1] <= x && x < arr[mid])

            return mid - 1;

  

        // If x is smaller than mid, floor

        // must be in left half.

        if (x < arr[mid])

            return floorSearch(

                arr, low,

                mid - 1, x);

  

        // If mid-1 is not floor and x is

        // greater than arr[mid],

        return floorSearch(

            arr, mid + 1, high,

            x);

    }

  

    /* Driver program to check above functions */

    public static void main(String[] args)

    {

        int arr[] = { 1, 2, 4, 6, 10, 12, 14 };

        int n = arr.length;

        int x = 7;

        int index = floorSearch(

            arr, 0, n - 1,

            x);

        if (index == -1)

            System.out.println(

                "Floor of " + x + " dosen't exist in array ");

        else

            System.out.println(

                "Floor of " + x + " is " + arr[index]);

    }

}







OUTPUT

Floor of 7 is 6.

CREDITS: https://www.geeksforgeeks.org/floor-in-a-sorted-array/