《算法解锁》封面

算法解锁

Algorithms unlocked

Thomas H. Cormen · 初版 2013 年

7人推荐
8位读者提及
10次提及

“本书为计算机算法的基础知识提供了引人入胜的入门指南。在 Algorithms Unlocked 一书中,该领域顶尖大学教材的合著者 Thomas Cormen 以精简的数学语言,通俗易懂地解释了计算机如何借助算法来解决问题。读者将了解到什么是计算机算法、如何描述算法以及如何对其进行评估。他们将发现计算机中检索信息的简易途径;将计算机中的信息重新按指定顺序排列的方法(“排序”);以及如何解决可建模为

Hacker News 上怎么说

  • ……在我看来反而削弱了内容的质量。而且,他对某些地方的大O表示法(big ohs)是怎么推出来的,也不总能解释得完全透彻。我的建议?直接去跟 MIT 的 OCW 课程(用的是 CLRS)。再搭配《Algorithms Unlocked》、楼主发在主楼的那个 Khan Academy 链接,以及 CLRS 作为补充。只要你啃透这 4 个资源并下了功夫,内容肯定能拿下。这 4 个资源都有托马斯·科尔曼(Thomas C)的基因在里面(他就是 CLRS 里的那个 C)。所以你会……

    …in my opinion detracts from the material. Also, he doesn't always fully explain where he got some of the big ohs here and there. My advice? Follow MIT's OCW course (it uses CLRS). Supplement it with Algorithms Unlocked, the Khan Academy link in OP and CLRS. If you use those 4 resources and put in the work you'll understand the material. All 4 sources have Thomas C's DNA touch to it (he is the C in CLRS). So you'll…

  • ……讲得挺好,但这不是这本书的重点,按我的记忆,他们就在一个地方实现了一个队列,也提了一嘴 big-oh,但全都是走马观花。托马斯·科尔曼最近出了本《Algorithms Unlocked》,对那些不想把自己大半辈子搭进去啃科尔曼那本大部头或者高德纳(Knuth)的程序员来说,这本书看起来是个很棒的入门读物。- 常数项因子变得越来越重要……

    …very well, it isn't that much in the focus of the book, they implement a queue in one place from what I remember, there is some mention of big-oh, but it's all rather cursory. Thomas Cormen published "Algorithms Unlocked" recently, which seems like a good intro book for programmers who are not willing to devote a fraction of their life to studying the big Cormen book or Knuth. - Constant factors matter increasingly more…

  • ……去看一门严谨的算法课体系。MIT 网上就有几门现成的可以看。一些适合新手的读物有:https://www.khanacademy.org/computing/computer-science/algor... https://www.amazon.com/Algorithms-Unlocked-Press-Thomas-Corm... https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press...(不是新手级别的,但堪称经典)搞定这些之后,你再去刷面试书就完全没问题了。你会想……

    …look at a rigorous course offering of Algorithms. MIT has a few online to view. Some readings for a beginner are: https://www.khanacademy.org/computing/computer-science/algor... https://www.amazon.com/Algorithms-Unlocked-Press-Thomas-Corm... https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press... (not beginner level but classic) After all of this you should be fine with diving into interview books. You'll want…

  • ……问题。罗维尔和夏努尔——《概念数学》(Conceptual Mathematics)。讲了一些范畴论的基础概念,旨在带你理解罗维尔对不完备性定理的澄清和推广。科尔曼——《Algorithms Unlocked》。相当于是教材的科普大众版。纳欣——《趣题探秘:迷人的微积分》(Inside Interesting Integrals)。超多有趣的积分算例!纳欣——他还写过几本关于欧拉和虚数的书,我零零散散读过一些,……

    …problems. Lawvere & Schanuel- Conceptual Mathematics. Some basic notions of category theory, geared towards teaching you Lawvere's clarification and generalization of the incompleteness theorems. Cormen - Algorithms Unlocked. Pop Science version of some of the textbook. Nahin - Inside interesting Integrals. Lots of fun integrations! Nahin - He also wrote some books about euler and imaginary numbers which ive partially read,…

  • ……Java):http://www.amazon.com/Algorithms-4th-Edition-Robert-Sedgewic... 他们还在 Coursera 上开了一门分两部分的算法课:https://www.coursera.org/courses?orderby=upcoming&search... 托马斯·科尔曼(CLRS 里的那个 C)最近也出了本新书叫《Algorithms Unlocked》,用伪代码介绍了一些常见的流行算法。http://www.amazon.com/Algorithms-Unlocked-Thomas-H-Cormen/dp...

    …Java): http://www.amazon.com/Algorithms-4th-Edition-Robert-Sedgewic... They also teach a two-part Algorithms course on Coursera: https://www.coursera.org/courses?orderby=upcoming&search... Thomas Cormen (the C in CLRS) also has a new book called Algorithms Unlocked which introduces some popular algorithms in pseudocode. http://www.amazon.com/Algorithms-Unlocked-Thomas-H-Cormen/dp...

  • 没错,科尔曼自己也觉得,对于可能会用到这部分内容的人群来说,《Algorithms Unlocked》其实是一本好得多的书。我在本文末尾加了更多链接,包含了一位算法学习小组组织者的推荐,成员大多是……

    Yes, Cormen thinks that Algorithms Unlocked is actually a much better book for the crowd that would likely use this content. I put more links in this article at the end, with recommendations from someone who runs an Algorithms study group for mostly…

正在加载完整评论……

键盘快捷键

/
聚焦搜索框
j / k
下一本 / 上一本
Enter
打开选中的书
Esc
关闭 / 返回
g h
回到首页
g b
值得读精选
g t
历史总榜
g r
上升最快
g l
我的书架
?
显示本帮助