Algorithms in C, Parts 1-4

Algorithms in C, Parts 1-4 pdf epub mobi txt 電子書 下載 2025

[美國] Robert Sedgewick
想要找書就要到 靜思書屋
立刻按 ctrl+D收藏本頁
你會得到大驚喜!!
Addison-Wesley Professional 1997-9-27 Paperback 9780201314526

具體描述

Robed Sedgewick擁有斯坦福大學博士學位(導師為Donald E. Knuth),昔林斯頓大學計算機科學係教授,Adobe Systems公司董事,曾是XeroxPARC的研究人員,還曾就職於美國國防部防禦分析研究所以及INRIA。除本書外,他還與Philippe Flajolet閤著瞭《算法分析導論》一書

"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.." - Steve Summit, author of C Programming FAQs Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive. - William A. Ward, University of South Alabama Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language. Highlights * Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures * Greater emphasis on abstract data types (ADTs) than in previous editions * Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations * New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more * Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them * Over 1000 new exercises to help you learn the properties of algorithms Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

用戶評價

評分

##將算法,算法代碼居然是錯誤的,我暈死 第5章遞歸與樹 程序5.12背包問題 int knap(int cap); 誰看過這個算法?完全不正確...... 求推薦,中文算法書,要求算法代碼絕對無錯誤的,謝謝  

評分

bug多

評分

##美國大學本科生課程“Algorithm and Data Structure”的指定教材,我偷懶,下瞭中文版來看,實在是忍不瞭翻譯,看迴英文版。明明很簡單的一句話能叫譯者說的不明所以。真是譯成這樣不如不譯啊。。。  

評分

##除去圖算法,第一至第四部分頁數不多,但是內容詳實。學算法最需要的是什麼?是想象力!想象數據結構在內存中是如何變化的,查看其中的奧秘學習其中的思想。可是算法難學啊,因為有些復雜算法不好想象。這本書從數據結構到排序到搜索,介紹瞭每個分類裏麵的幾大經典,各個都有...  

評分

##P32 錶2-4 “當M增加一倍時,順序搜索的時間也增加一倍,但二分搜索幾乎不變” 其中M當為N。 因為順序搜索的時間復雜度跟MN正比而二分搜索跟MlogN正比,顯而易見M增加時兩種算法耗時均綫性遞增。 嗯,我的評論很短麼?居然不讓發錶??好吧,我刷個屏看看。 刷屏刷屏刷屏刷...  

評分

評分

##對各種算法之間的聯係的介紹尤為精彩。

評分

評分

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

© 2025 book.tinynews.org All Rights Reserved. 静思书屋 版权所有