局部最小值的算法

這是一種基於分治的作法 基於二分的對於數組的O(lgn)級別的算法 Find local minima in an array You are given an array Arr[1 .. n] with the special property that Arr[1] ≥ Arr[2] and Arr[n − 1] ≤ Arr[n]. We say that an element Arr[x]

>>阅读原文<<