Binary Search

代码实现

Java

public class BinarySearch {
    public static int rank(int key, int[] a) {
        int lo = 0;
        int hi = a.length - 1;
        while (lo <= hi) {
            int mid = lo + (hi - lo) / 2;
            if (key < a[mid]) hi = mid - 1;
            else if (key > a[mid]) lo = mid + 1;
            else return mid;
        }
        return -1;
    }
}
Main.java
public class Main {
    public static void main(String[] args) {
        int[] a = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        System.out.println(BinarySearch.rank(4, a));
    }
}
#algorithm

Read Next

Red-Black Tree

Red-Black Tree is a data structure that stores elements in a binary search tree.

Dynamic Programming

Dynamic Programming is a technique used to solve optimization problems by breaking them down into smaller subproblems.