演算法›Ch2 分治法
第 8 題/共 12 題
◀ AL 8/12
8. Peak Finding、Divide and Conquer
#AL-02-008中Peak FindingDivide and Conquer
  1. Let a1,a2,…,ana_1, a_2, \ldots, a_n be a sequence of integers and assume that a0=an+1=−∞a_0 = a_{n+1} = -\infty. For any i with 1≤i≤n1 \le i \le n, we define aia_i to be a peak, if ai≥max⁡(ai−1,ai+1)a_i \ge \max(a_{i-1}, a_{i+1}).

(a) (2%). Identify all peaks in the given sequence 6, 7, 4, 3, 2, 1, 4, 5.

(b) (2%). Write down a procedure that finds a peak for a1,…,ana_1, \ldots, a_n in O(log⁡n)O(\log n) time.

(c) (2%). Briefly justify your answer in (b).

📄 交大112
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch2 分治法
本章題號 · 1–12 / 12