blocks|key|2396140|text|Steve+Skiena的Algorithm+Design+Manual并不是那么好笑，但它相对较深的数学知识相对较少，包含了许多他所说的“战争故事”，这些都是现实世界中算法工作真正得到回报(或者，有时是完全失败)的说明性例子。他也有他的audio+and+video+lectures+online，他的演讲风格很好，穿插着一些幽默，所以这可能就是你想要的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2396141|entityMap|0|LINK|mutability|MUTABLE|url|http://www.cs.sunysb.edu/~algorith/|1|https://rads.stackoverflow.com/amzn/click/com/1848000693|2|http://www.cs.sunysb.edu/~algorith/video-lectures/^0|0|C|0|D|N|1|3B|V|2|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]|$A|T|B|U|1|V]|$A|W|B|X|1|Y]]|C|$]]|$1|D|3|-4|5|6|7|Z|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]|L|$5|G|H|I|C|$J|M]]|N|$5|G|H|I|C|$J|O]]]]

The <a href="https://rads.stackoverflow.com/amzn/click/com/1848000693" rel="noreferrer" rel="nofollow noreferrer">Algorithm Design Manual</a> by <a href="http://www.cs.sunysb.edu/~algorith/" rel="noreferrer">Steve Skiena</a> isn't exactly a barrel of laughs, but it's relatively light on the deeper mathematics and contains lots of what he calls "War Stories", which are illustrative examples from real world situations where algorithm work really paid off (or, sometimes, totally failed). He's also got his <a href="http://www.cs.sunysb.edu/~algorith/video-lectures/" rel="noreferrer">audio and video lectures online</a>, and he's got a nice lecture style with bits of humor interspersed, so it might be what you are looking for.

blocks|key|2396220|text|这也不是很轻，但它相当不错|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2396221|Algorithms+and+data+structures+by+Robert+Lafore|offset|length|2396222|entityMap|0|LINK|mutability|MUTABLE|url|https://rads.stackoverflow.com/amzn/click/com/1571690956^0|0|0|1B|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

This too is not light either but it is pretty decent 

<a href="https://rads.stackoverflow.com/amzn/click/com/1571690956" rel="nofollow noreferrer" rel="nofollow noreferrer">Algorithms and data structures by Robert Lafore</a>

blocks|key|5924424|text|在我看来，没有什么比http://www.amazon.com/Bundle-Algorithms-Parts-1-5-Fundamentals/dp/020172684X更具可读性和意义了|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|5924425|这是两本书，第五部分是图表，没有其他书那么有用--当然，除非你想用图表来解决问题。:)|5924426|entityMap|0|LINK|mutability|MUTABLE|url|https://rads.stackoverflow.com/amzn/click/com/020172684X^0|A|24|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

There is nothing more readable and meaningful, in my opinion than <a href="https://rads.stackoverflow.com/amzn/click/com/020172684X" rel="nofollow noreferrer" rel="nofollow noreferrer">http://www.amazon.com/Bundle-Algorithms-Parts-1-5-Fundamentals/dp/020172684X</a>

It's 2 books, part 5 being graphs and is not as useful as the other book - unless of course, you want to use graphs to solve a problem. :)

blocks|key|2396302|text|How+to+Solve+it+By+Computer+by+Dromey，虽然不完全是一本算法书籍，但采取了重新发现过程的方法，多年来许多数据结构和算法都是通过这个过程得出的。这使我们能够理解代码背后的思想流程和一些起作用的力量。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2396303|相关:这本书遵循了另一本伟大的书：How+to+Solve+It+by+G.+Polya的脚步，这本书讲述了伟大的数学家如何解决问题的过程。|2396304|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/How_to_Solve_It_By_Computer|1|http://en.wikipedia.org/wiki/How_to_Solve_It^0|0|11|0|0|H|R|1|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]]|C|$]]|$1|D|3|E|5|6|7|T|8|@]|9|@$A|U|B|V|1|W]]|C|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]|N|$5|I|J|K|C|$L|O]]]]

<a href="http://en.wikipedia.org/wiki/How_to_Solve_It_By_Computer" rel="nofollow">How to Solve it By Computer by Dromey</a> though not exactly an algorithms book takes the approach of re-discovering the process by which many data-structures and algorithms were arrived at over the years. This allows us to understand the flow of thought behind the code and some of the forces at work.

Related: This book follows in the foot-steps of another great book: <a href="http://en.wikipedia.org/wiki/How_to_Solve_It" rel="nofollow">How to Solve It by G. Polya</a> which talks about how great mathematicians go about the problem-solving process.

blocks|key|5924365|text|我目前正在使用Larry+Nyhoff的ADTs,+Data+Structures,+and+Problem+Solving+with+C%2B%2B。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|5924366|它不像Head+First系列书那样轻便或有趣，但它对二叉树、b树和图的细节非常详细。它的代码示例对完成我的任务非常有帮助。理解文本不需要更高的数学知识(当然，除了专门介绍算法分析的章节)。|5924367|entityMap|0|LINK|mutability|MUTABLE|url|https://rads.stackoverflow.com/amzn/click/com/0131409093^0|K|1F|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

I'm currently using Larry Nyhoff's <a href="https://rads.stackoverflow.com/amzn/click/com/0131409093" rel="nofollow noreferrer" rel="nofollow noreferrer">ADTs, Data Structures, and Problem Solving with C++</a>.

It's not as light or enjoyable to read as a Head First series book, but it's really well detailed on binary trees, b trees, and graphs. Its code samples have been really helpful for completing my assignments. No higher math knowledge is required to understand the text (except, of course, on the chapter dedicated to algorithm analysis).

blocks|key|5924400|text|Beginning+Algorithms+by+Harris+and+Ross+(+Wrox+Press的一本书)是我喜欢的一本书，尽管它的例子是用Java语言而不是C%2B%2B语言编写的。这可能是你在课堂上艰难通过的课文的一个很好的伴奏。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|5924401|entityMap|0|LINK|mutability|MUTABLE|url|https://rads.stackoverflow.com/amzn/click/com/0764596748^0|0|13|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

<a href="https://rads.stackoverflow.com/amzn/click/com/0764596748" rel="nofollow noreferrer" rel="nofollow noreferrer">Beginning Algorithms by Harris and Ross</a> (a Wrox Press book) was one I liked, although its examples are presented in Java, not C++. Might be a nice accompaniment to the text you're trudging through in class.

blocks|key|4508708|text|我听说过关于“算法简介，一种创造性的方法--+Udi+Manber”的好消息，但我不能证实它，因为它在本地不可用:(|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4508709|http://www.amazon.com/Introduction-Algorithms-Creative-Udi-Manber/dp/0201120372|offset|length|4508710|entityMap|0|LINK|mutability|MUTABLE|url|https://rads.stackoverflow.com/amzn/click/com/0201120372^0|0|0|27|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

I've heard good things about "Introduction to algorithms, A creative approach - Udi Manber"
I can't verify it though since it's not available locally :(

<a href="https://rads.stackoverflow.com/amzn/click/com/0201120372" rel="nofollow noreferrer" rel="nofollow noreferrer">http://www.amazon.com/Introduction-Algorithms-Creative-Udi-Manber/dp/0201120372</a>

I loved the Head First series book on object oriented design. It was a very gentle and funny introduction to the subject. I am currently taking a data structures class and find the text we are using (Kruse/Ryba Data Structures and Program Design in C++) to be very dry and hard to comprehend. This is mostly due I think to my own limitations in the area of Mathematics.

Does anyone know of a Data Structures text that is written in a lighter style, with a sense of humor, that still covers all the basics like Binary Trees, B Trees, and Graphs?

'Head First' Style Data Structures & Algorithms Book?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

我喜欢Head First系列关于面向对象设计的书。这是对这个主题的一个非常温和和有趣的介绍。我最近上了一个数据结构课，发现我们使用的文本(C++中的Kruse/Ryba数据结构和程序设计)非常枯燥，很难理解。我认为这主要是由于我自己在数学领域的局限性。有没有人知道这样一种数据结构文本，它是以一种轻松的风格和幽默感编写的，仍然涵盖了像二叉树、B树和图形这样的所有基础知识？

问“'Head”风格的数据结构与算法书？
EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问“'Head”风格的数据结构与算法书？EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问“'Head”风格的数据结构与算法书？
EN