【算法设计与数据结构】三分法：求单峰函数的极值

介绍

示例代码

[code]void Solve()
{
    double left, right, m1, m2, m1_value, m2_value;
    left = MIN;
    right = MAX;
    while (left + EPS < right)
    {
        m1 = left + (right - left)/3;
        m2 = right - (right - left)/3;
        m1_value = f(m1);
        m2_value = f(m2);
        //假设求解极大值
        if (m1_value >= m2_value)
            right = m2;
        else
            left = m1; 
    }
}