理学 算法设计 释 divide and conquer 分治法 分治法（divide and conquer）是计算机科学中一种重要的算法。字面上的解释是“分而治之”，就是把一个复杂的问题分成两个或更多的相同或相似的子问题，再把子问题分成更小的子问题……直到最后子问题可以简单地直接求解，原问题的解即子问题的解的合并。这个技巧是很多高效算法的基础，如排序算法（快速排序、合并排序）。
理论计算机科学 算法设计与分析 释文 divide and conquer 分治
- Japan Magazine Publishers Association
- Japan Meteorological Agency
- Japan News Network
- Japan one village, one product
- Japan Patent Information Organization
- Japan Playwrights Association
- Japan Proton Accelerator Research Complex
- Japan Railway Disaster Prevention System
- Japan Railway Technical Research Institute
- Japan Satellite Broadcasting Inc
- Japan's bombardment of the Xinshenglong Ship
- Japan Science and Technology Agency
- Japanse army's experiments for biological weapons
- Japan's modern agricultural economy
- Japan Society for the Study of the Book of Songs
- Japan Society of Chinese Ci Poetry
- Japan Society of Human Culture
- Japan Society of Library and Information Science
- Japan Society of Publishing Studies
- Japan space activities
- Japan Standard Time
- Japan stemona
- Japan thistle
- Japan Trench
- Japan Tsukuba science city