You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
23 lines
907 B
23 lines
907 B
---
|
|
comments: true
|
|
icon: material/set-split
|
|
---
|
|
|
|
# 第 12 章 分治
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
難題被逐層拆解，每一次的拆解都使它變得更為簡單。
|
|
|
|
分而治之揭示了一個重要的事實：從簡單做起，一切都不再複雜。
|
|
|
|
## Chapter Contents
|
|
|
|
- [12.1 分治演算法](https://www.hello-algo.com/en/chapter_divide_and_conquer/divide_and_conquer/)
|
|
- [12.2 分治搜尋策略](https://www.hello-algo.com/en/chapter_divide_and_conquer/binary_search_recur/)
|
|
- [12.3 構建樹問題](https://www.hello-algo.com/en/chapter_divide_and_conquer/build_binary_tree_problem/)
|
|
- [12.4 河內塔問題](https://www.hello-algo.com/en/chapter_divide_and_conquer/hanota_problem/)
|
|
- [12.5 小結](https://www.hello-algo.com/en/chapter_divide_and_conquer/summary/)
|