分治算法与动态规划算法研究  

Study on divide-and-conquer algorithm and dynamic programming algorithm

作　　者：奚雨新 Xi Yuxin(Liaoning Normal University,Dalian Liaoning 116000)

机构地区：[1]辽宁师范大学,辽宁大连116000

出　　处：《长江信息通信》2021年第6期44-46,共3页Changjiang Information & Communications

摘　　要：计算机在各个领域应用的过程中,都会涉及到用高效的算法解决问题。分治算法和动态规划算法作为程序设计的基本算法,它有助于我们更高效地获得问题的解决方案。文章对两种算法进行了梳理,将两种算法融入到实际问题中,便于更好地领略两种算法的思想、设计过程。In the process of computer application in various fields,it will involve solving problems with efficient algorithms.Divide and Conquer algorithm and dynamic programming algorithm as the basic algorithm of program design,it helps us to get the solution of the program more efficiently. In this paper,the two algorithms are sorted out and incorporated into the real problems,to better understand the ideas of the two algorithms,the design process.

关 键 词：分治算法 动态规划算法 设计过程 

分 类 号：O224[理学—运筹学与控制论]