理学 算法设计 释 divide and conquer 分治法 分治法（divide and conquer）是计算机科学中一种重要的算法。字面上的解释是“分而治之”，就是把一个复杂的问题分成两个或更多的相同或相似的子问题，再把子问题分成更小的子问题……直到最后子问题可以简单地直接求解，原问题的解即子问题的解的合并。这个技巧是很多高效算法的基础，如排序算法（快速排序、合并排序）。
理论计算机科学 算法设计与分析 释文 divide and conquer 分治 理论计算机科学 算法设计与分析 释文 divide and conquer 分治
- archaeal sulfate reducer
- archaeal virus
- archaebacteria
- archaefructus
- archaeoastronomy
- archaeocyatha
- archaeocyte
- Archaeoglobus fulgidus genome
- Archaeological Areas of Pompei, Herculaneum and Torre Annunziata
- Archaeological Chemistry
- archaeological chronology
- Archaeological Dating
- archaeological drawing
- Archaeological Excavation and Researches in New China
- Archaeological Geophysical Exploration
- archaeological geophysical prospecting
- Archaeological Heritage of the Lenggong Valley
- Archaeological Museum in Zagreb
- Archaeological Museum Osijek
- archaeological photography
- archaeological reconnaissance
- Archaeological Reconstruction Drawing
- archaeological remains on Marquesas Islands
- Archaeological Site
- Archaeological Site Museum of Nanyue Palace