理学 算法设计 释 divide and conquer 分治法 分治法（divide and conquer）是计算机科学中一种重要的算法。字面上的解释是“分而治之”，就是把一个复杂的问题分成两个或更多的相同或相似的子问题，再把子问题分成更小的子问题……直到最后子问题可以简单地直接求解，原问题的解即子问题的解的合并。这个技巧是很多高效算法的基础，如排序算法（快速排序、合并排序）。
理论计算机科学 算法设计与分析 释文 divide and conquer 分治 理论计算机科学 算法设计与分析 释文 divide and conquer 分治
- unconstrained
- unconstrained minimization
- unconstrained optimization
- unconstrained optimization method
- unconstrained system
- uncontinuity
- uncontrollable factor
- uncontrolled fission
- uncontrolled rectifying circuit
- UN Convention against Corruption，UNCAC
- unconventional
- unconventional and conventional
- unconventional clothing design
- unconventional combustion technologies
- unconventional decision making
- unconventional drilling method
- unconventional energy
- unconventional gas
- unconventional luminescent polymer
- unconventionally graceful
- unconventional oil
- unconventional oil and gas
- unconventional oil and gas resource evaluation
- unconventional pairing
- unconventional reservoir seepage