weixin_48086091的博客

Algorithm Algorithm Thinking Peak finding 1-Dimensional array 1.Def: b is a peak iff it’s b≥a & b≥c. 2.straightforward algorithm : starts from the left then walks across the array complexity: i.The worst case complexity is called θ\thetaθ n , it’s es