Algorithms in C, Parts 1-4

Algorithms in C, Parts 1-4 下載 mobi epub pdf 電子書 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.

用戶評價

評分

評分

##作者的主頁上好像也找不到,隻有書中的code和errta(話說我提交的edition3 的一個error貌似也無人理睬。)不知道有沒有人願意討論下裏麵的習題?我剛看到棧那裏。 這個評論到底要多長纔行……  

評分

##作者的主頁上好像也找不到,隻有書中的code和errta(話說我提交的edition3 的一個error貌似也無人理睬。)不知道有沒有人願意討論下裏麵的習題?我剛看到棧那裏。 這個評論到底要多長纔行……  

評分

評分

評分

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

評分

評分

##手頭有國外的英文版3rd eidition,也有機械工業的中文版3rd eidition。可是為什麼中文版比英文版薄瞭好多? 看過國內的英文版,或者國外英文版的同學誰能說一下,是不是翻譯版有刪減啊。 我沒仔細看,紅黑樹那一節,我的英文版有12頁左右,可是中文版大概隻有7頁。 沒人發現...  

評分

本站所有內容均為互聯網搜尋引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度google,bing,sogou

© 2025 book.qciss.net All Rights Reserved. 圖書大百科 版權所有