1、求第k小数(分治)
https://blog.csdn.net/qq_41727666/article/details/82887049
2、0-1背包(回溯)(当前重量小于容量这一剪枝条件必须要有)
https://blog.csdn.net/qq_41727666/article/details/82911876
3、穷举所有排列(回溯)
https://blog.csdn.net/qq_41727666/article/details/82911876
4、跳马(分支限界)
https://blog.csdn.net/qq_41727666/article/details/82957071
5、多机调度程序(贪心)