The Algorithm Design Manual pdf epub mobi txt 电子书下载 2025

☆☆☆☆☆

Steven Skiena (1961-, http://www.cs.sunysb.edu/~skiena/) is a Professor of Computer Science in State University of New York at Stony Brook

出版者:Springer

作者:Steven S Skiena

出品人:

页数:746

译者:

出版时间:2010-11-5

价格:USD 89.95

装帧:Paperback

isbn号码:9781849967204

丛书系列:

图书标签:

算法
Algorithm
计算机
Programming
计算机科学
编程
数据结构与算法
美国

下载链接在页面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小美书屋

book.quotespace.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new "war stories" and "interview problems", relating experiences from real-world applications. Written by a well-known, IEEE Computer Science teaching-award winner, this new edition is an essential learning tool for students needing a solid grounding in algorithms, as well as a uniquely comprehensive text/reference for professionals.

具体描述

读后感

评分☆☆☆☆☆

看着看着时而就觉得不明白了看到amazon上有人说 This book isn't always the easiest to understand.. . Consider the explanation of Djikstra's Algorithm on p. 206 of the 2nd ed: ... 我才放下心来. 他就是没讲明白么,真是的!

评分☆☆☆☆☆

我个人认为这本书很不适合初学者，尤其是和DPV（http://book.douban.com/subject/1996256/）相比。如果你和我一样在找一本比较好的算法入门书，强烈推荐DPV而不是这本。DPV对算法的讲解简单而明了，如果我只能推荐一本算法书的话，毫无疑问我会推荐DPV。当然，这本书或许对...

评分☆☆☆☆☆

Compared with CLRS: - Both books are well written and way above the average. - "Almost" as great as the classic CLRS. - Not so textbook like which is both good and bad: - Has clearer statements about goals and abstractions of algorithms and data struct...