Java Binary Search binarySearch(double experience, int min, int max)

Description

Utilizes a basic binary search algorithm to find the level for the specified experience.

License

Open Source License

Parameter

Parameter	Description
experience	The experience.
min	The minimum level.
max	The maximum level.

Return

The level for the specified experience.

Declaration

private static int binarySearch(double experience, int min, int max) 

Method Source Code

//package com.java2s;
//License from project: Open Source License 

public class Main {
    /**/*from  w  ww .  j  a va  2 s  .c  om*/
     * A mapping of level -> experience.
     */
    private static final double[] EXPERIENCE_TABLE = { 0, 83, 174, 276, 388, 512, 650, 801, 969, 1154, 1358, 1584,
            1833, 2107, 2411, 2746, 3115, 3523, 3973, 4470, 5018, 5624, 6291, 7028, 7842, 8740, 9730, 10824, 12031,
            13363, 14833, 16456, 18247, 20224, 22406, 24815, 27473, 30408, 33648, 37224, 41171, 45529, 50339, 55649,
            61512, 67983, 75127, 83014, 91721, 101333, 111945, 123660, 136594, 150872, 166636, 184040, 203254,
            224466, 247886, 273742, 302288, 333804, 368599, 407015, 449428, 496254, 547953, 605032, 668051, 737627,
            814445, 899257, 992895, 1096278, 1210421, 1336443, 1475581, 1629200, 1798808, 1986068, 2192818, 2421087,
            2673114, 2951373, 3258594, 3597792, 3972294, 4385776, 4842295, 5346332, 5902831, 6517253, 7195629,
            7944614, 8771558, 9684577, 10692629, 11805606, 13034431 };

    /**
     * Utilizes a basic binary search algorithm to find the level for the specified experience.
     * 
     * @param experience The experience.
     * @param min The minimum level.
     * @param max The maximum level.
     * @return The level for the specified experience.
     */
    private static int binarySearch(double experience, int min, int max) {
        int mid = (min + max) / 2;
        double value = EXPERIENCE_TABLE[mid];

        if (value > experience) {
            return binarySearch(experience, min, mid - 1);
        } else if (value == experience || EXPERIENCE_TABLE[mid + 1] > experience) {
            return mid + 1;
        } else {
            return binarySearch(experience, mid + 1, max);
        }
    }
}

Related

1. binarySearch(byte[] a, byte key, int startPos)
2. binarySearch(byte[] a, int key)
3. binarySearch(byte[] readBuffer, int offset, int length, byte value)
4. binarySearch(char[] arr, int key)
5. binarySearch(double values[], double search)
6. binarySearch(double[] a, double key)
7. binarySearch(double[] arr, double value, int p, int q)
8. binarySearch(final double[] array, final double val)