理学 算法设计 释 divide and conquer 分治法 分治法（divide and conquer）是计算机科学中一种重要的算法。字面上的解释是“分而治之”，就是把一个复杂的问题分成两个或更多的相同或相似的子问题，再把子问题分成更小的子问题……直到最后子问题可以简单地直接求解，原问题的解即子问题的解的合并。这个技巧是很多高效算法的基础，如排序算法（快速排序、合并排序）。
理论计算机科学 算法设计与分析 释文 divide and conquer 分治
- international cooperation
- international cooperation and exchange of archives
- international cooperation exploitation of natural resources
- international cooperation in confiscation
- international cooperation in drug control
- international cooperation in space
- International Cooperation on Harmonization of Technical Requirements for the Registration of Veterinary Medicinal Products
- international cooperation on securities supervision
- international cooperation projects of elderly health
- International Cooperation Strategy in Cyberspace
- international cooperative investment
- International Coordinate Council on Man and Biosphere Programme
- international coordination in competition policy
- international co-production
- International Copyright Information Center，ICIC
- international copyright licensing programs
- International Council for Adult Education
- International Council for Pressure Vessel Technology
- International Council for Scientific and Technical Information
- International Council for the Exploration of the Sea
- International Council for Traditional Music
- International Council of Design
- International Council of Museums-Committee for Conservation
- International Council of Nurses
- International Council of Sport Science and Physical Education