【算法】二分查詢

/** * 二分查詢 * @author DUSTDAWN * n*(1/2)^x=1,時間複雜度x=log2 n */ public class Solution_1 { public static void main(String[] args) { int nums[] = {-1,0,3,9,5,12}; System.out.println(search(nums,3));

>>阅读原文<<