Algorithms Unlocked

Algorithms Unlocked pdf epub mobi txt 电子书 下载 2025

Thomas H. Cormen
想要找书就要到 静思书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!
The MIT Press 2013-3-1 Paperback 9780262518802

具体描述

Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms.

Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen—coauthor of the leading college textbook on the subject—provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems.

Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order (“sorting”); how to solve basic problems that can be modeled in a computer with a mathematical structure called a “graph” (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.

用户评价

评分

##本书中说到“算法是计算机科学的核心。这是一本力图针对大众读者的算法书籍。它使一个抽象的主题变得简洁易懂,而没有过多拘泥于细节。本书具有深远的影响,还没有人能够比托马斯 H. 科尔曼更能胜任缩小算法专家和公众的差距这一工作。 —— Frank Dehon,卡尔顿大学计算机科学...  

评分

##非常棒的书 这个Cormen就是Introduction to Algorithms那本书的Cormen

评分

##非常棒的书 这个Cormen就是Introduction to Algorithms那本书的Cormen

评分

评分

评分

##这是我大四时候花了将近一个月的闲暇时光读完的,是我的计算机算法和编程的启蒙教材。这本书是算法导论的跳板。等我编程算法羽翼丰满会去挑战算法导论的,真的很有意思。益智而且对学术有用。

评分

##对新手友好,难度偏低,大概相当 LeetCode easy 从最开始看这本书的时候就感觉到有些地方被翻译的莫名其妙,明明是很浅显的道理,却非得绕一个大圈子表达出来。越是看到内容较为复杂的部分,这种现象出现的就越是频繁,终于让我确定肯定是翻译出现了问题。从最短路径的Dijkstra算法一节中举例如下: 从本书第90页底部开始: ...  

评分

评分

##本书中说到“算法是计算机科学的核心。这是一本力图针对大众读者的算法书籍。它使一个抽象的主题变得简洁易懂,而没有过多拘泥于细节。本书具有深远的影响,还没有人能够比托马斯 H. 科尔曼更能胜任缩小算法专家和公众的差距这一工作。 —— Frank Dehon,卡尔顿大学计算机科学...  

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.idnshop.cc All Rights Reserved. 静思书屋 版权所有