- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
第4章贪心算法(The fourth chapter greedy algorithm)
第4章贪心算法(The fourth chapter greedy algorithm)
Collected by oneself
Mistakes are unavoidable
For reference only
In case of error
Please correct me! Thank you
Talking about greedy algorithm
A school of Jin Xiaodai
Greedy algorithm is a simple and effective programming algorithm that conforms to peoples thinking habits
Greedy algorithm can be used to solve the optimal problem
It often has its place in the informatics competition
In a few recent contests, you can see the use of greedy algorithms:
The 2006 Winter wind
2007 noip souvenir distribution
2007 IOI Chinese team Pendant
2008noip sorting chairs.
2008ioi conveyor
What is greedy algorithm? Seeing the name of a thing one thinks of its function
Greedy algorithms always make the best choice in the present
Although greedy algorithms do not have the overall optimal solution for all problems
But for a wide range of problems, we can produce the global optimal solution or the sub optimal solution of the problem
Therefore, it is necessary to study it well
We first look at the greedy algorithm in the data structure of the application
Prim algorithm for minimum spanning tree
The chosen vertex is an endpoint of the smallest weight in the candidate edge
While the Kruskal algorithm in embordering method
First of all, the weight of the edge is sorted from small to large and selected in turn
Look at the algorithm for finding the shortest path of a single source
The basic idea of the algorithm is to set the vertex set s and continue to make greedy choices
To expand this collection
In order to obtain the shortest path at last
Huffman coding is also used greedy algorithm
Both greedy algorithm and divide and conquer method and dynamic programming have three substructures
They all reduce the original problem to a smaller scale of similar subproblems
And by solving subproblems
Finally, the global solution is obtained
Whats the difference between the three? Only make clear the difference between the three
Its good to use them to solve pro
您可能关注的文档
- 工程项目管理实例试卷(Example of engineering project management).doc
- 工程项目管理试题精华(Project management, examination questions, essence).doc
- 巴士(贤旭控宝宝)(Bus (Xian Xu controls baby)).doc
- 海 港-2(Seaport -2).doc
- 海.中信红树湾(CITIC Mangrove Bay).doc
- 海南风景区介绍(Introduction of Hainan scenic spot).doc
- 海涅的诗(Henie's Poetry).doc
- 海贼王漫画总目录(One Piece comics catalog).doc
- 海陵区2006~2007第一学期期末考试(Hailing area 2006~2007 first semester final examination).doc
- 消防系统知识(Fire system knowledge).doc
- 第7章cad电子教案(The seventh chapter CAD electronic lesson plan).doc
- 第7章行政决策(The seventh chapter is administrative decision).doc
- 第8章 项目施工管理(The eighth chapter project construction management).doc
- 第一届世界绿色天使盛会大型系列活动(简介).txt11(.txt11 series of activities of the first world green Angel event (brief introduction)).doc
- 第一章 建筑热工学基本知识 习题(Chapter 1 basic knowledge of building thermal engineering).doc
- 第6章 空气洁净技术(The sixth chapter air cleaning technology).doc
- 第一章、嵌入式系统基础 1(Chapter 1, foundation of embedded system 1).doc
- 第一篇建筑热工学(The first architectural thermal engineering).doc
- 第一部分《化工原理》考试大纲(The first part, principles of Chemical Engineering examination outline).doc
- 第一财经 新闻 [新中国60年]鞍山六十年钢城的四大转型(The first 60 years of the new financial news [China] for sixty years in Anshan the transformation of four steel city).doc
文档评论(0)