Description: Eight Queens problem, gold array of issues, horse Hamiltonian tour, arranged in lexicographic order, color and other classic Tower of Hanoi algorithm is simple to solve, especially for beginners reference.
To Search:
- [goldIssuse] - Algorithm design in gold on the issue of
- [jinbi] - Gold array problem m* n (m ≤ 100, n ≤ 10
File list (Check if you may need any files):
新建文件夹\众数问题.cpp
..........\八皇后问题.cpp
..........\双色Hanoi塔问题.cpp
..........\排列的字典序问题.cpp
..........\整数因子分解问题.cpp
..........\最多约数问题.cpp
..........\最大间隙问题.cpp
..........\线性表.cpp
..........\邮局选址问题.cpp
..........\金币阵列.cpp
..........\马的Hamilton周游.cpp
新建文件夹
Download