"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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Descrizione libro Condizione libro: New. This is an International Edition Brand New Paperback Same Title Author and Edition as listed. ISBN and Cover design differs. Similar Contents as U.S Edition. Standard Delivery within 6-14 business days ACROSS THE GLOBE. We can ship to PO Box address in US. International Edition Textbooks may bear a label "Not for sale in the U.S. or Canada" or "For sale in Asia only" or similar restrictions- printed only to discourage students from obtaining an affordable copy. US Court has asserted your right to buy and use International edition. Access code/CD may not provided with these editions. We may ship the books from multiple warehouses across the globe including Asia depending upon the availability of inventory. Printed in English. Customer satisfaction guaranteed. Codice libro della libreria RU_9788131712917
Descrizione libro Addison-Wesley Professional. Condizione libro: New. 0201314525 This is an International Edition. Brand New, Paperback, Delivery within 6-14 business days, Similar Contents as U.S Edition, ISBN and Cover design may differ, printed in Black & White. Choose Expedited shipping for delivery within 3-8 business days. We do not ship to PO Box, APO , FPO Address. In some instances, subjects such as Management, Accounting, Finance may have different end chapter case studies and exercises. International Edition Textbooks may bear a label "Not for sale in the U.S. or Canada" and "Content may different from U.S. Edition" - printed only to discourage U.S. students from obtaining an affordable copy. The U.S. Supreme Court has asserted your right to purchase international editions, and ruled on this issue. Access code/CD is not provided with these editions , unless specified. We may ship the books from multiple warehouses across the globe, including India depending upon the availability of inventory storage. Customer satisfaction guaranteed. Codice libro della libreria UA9780201314526
Descrizione libro Softcover. Condizione libro: New. Brand New; Shrink Wrapped; Paperback; Black & White or Color International Edition. ISBN and Cover page may differ but similar contents as US edition. GET IT FAST in 3-5 business days by DHL/FEDEX with tracking number. Books printed in English. No shipping to PO Box/APO/FPO address. In some instances the international textbooks may have different end chapter case studies and exercises. International Edition Textbooks may bear a label "Not for sale in the U.S. or Canada" and "Content may different from U.S. Edition" - printed only to discourage U.S. students from obtaining an affordable copy. The U.S. Supreme Court has asserted your right to purchase international editions, and ruled on this issue. Access code or CD is not provided with these editions, unless specified. We may ship the books from multiple warehouses across the globe, including India depending upon the availability of inventory storage. Customer satisfaction guaranteed. Codice libro della libreria GFI1424843
Descrizione libro Addison-Wesley Professional. PAPERBACK. Condizione libro: New. 0201314525 New Book. International Edition with great quality. Fast delivery is guaranteed!!. Codice libro della libreria INDMRK-9788131712917
Descrizione libro Softcover. Condizione libro: Brand New. .. Black & White or color International Edition. ISBN and front cover may be different, but contents are same as the US edition. Book printed in English. GET IT FAST within 3-5 business days by DHL/FedEx/Aramex and tracking number will be uploaded into your order page within 24-48 hours. Territorial restrictions may be printed on the book. No shipping to PO BOX, APO, FPO addresses. Kindly provide day time phone number in order to ensure smooth delivery. 100% Customer satisfaction guaranteed!. . Codice libro della libreria BD000245
Descrizione libro Paperback. Condizione libro: New. New Softcover International Edition, Printed in Black and White, Only USPS Media mail Shipping ONLY, Different ISBN, Same Content As US edition, Book Cover may be Different, in English Language. Codice libro della libreria 14873
Descrizione libro Addison-Wesley Professional. PAPERBACK. Condizione libro: New. 0201314525 New Condition. Codice libro della libreria NEW4.0088516
Descrizione libro Addison-Wesley Professional, 1997. Condizione libro: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: I. FUNDAMENTALS. Introduction.Algorithms.A Sample Problem -- Connectivity.Union-Find Algorithms. Perspective.Summary Of Topics.Principles Of Algorithm Analysis.Empirical Analysis.Predictions And Guarantees.Growth Of Functions.Big-Oh Notation.Example: Connectivity Algorithms.Computational Complexity.Perspective.II. DATA STRUCTURES. Elementary Data Structures.Types And Structures.Arrays.Linked Lists.Elementary List Processing.Storage Allocation For Lists.Strings.Compound Structures.Perspective.Trees And Recursion.Properties Of Trees.Representing Binary Trees.Representing Forests.Traversing Trees.Elementary Recursive Programs.Divide-And-Conquer.Depth-First Search.Removing Recursion.Elementary Abstract Data Types.Pushdown Stack Adt.Stack Adt Implementations.Queue Adts And Implementations.String Adt And Implementations.Set Adt And Implementations.Amortized Growth For Array Implementations.III. SORTING. Elementary Sorting Methods.Rules Of The Game.Selection Sort.Insertion Sort.Bubble Sort.Performance Characteristics Of Elementary Sorts.Shellsort.Sorting Other Types Of Data.Index And Pointer Sorting.Sorting Linked Lists.Distribution Counting.Quicksort.The Basic Algorithm.Performance Characteristics Of Quicksort.Stack Size.Small Subfiles.Median-Of-Three Partitioning.Equal Keys.Strings And Vectors.Selection.Mergesort.Two-Way Merging.Abstract Implace Merge.Top-Down Mergesort.Improvements To The Basic Algorithm.Bottom-Up Mergesort.Performance Characteristics Of Mergesort.Linked-List Implementations Of Mergesort.Recursion Revisited.Priority Queues And Heapsort.Elementary Implementations.Heap Data Structure.Algorithms On Heaps.Heapsort.Priority-Queue Abstract Data Type.Indirect Priority Queues.Binomial Queues.Radix Sorting.Bits, Bytes, And Words.Binary Quicksort.Msd Radix Sort.Three-Way Radix Quicksort.Lsd Radix Sort.Performance Characteristics Of Radix Sorts.Sublinear-Time Sorts.Special-Purpose Sorts.Batcher's Odd-Even Mergesort.Sorting Networks.External Sorting.Sort-Merge Implementations.Parallel Sort/Merge.IV. SEARCHING. Symbol Tables And Bsts.Symbol-Table Abstract Data Type.Key-Indexed Search.Sequential Search.Binary Search.Binary Search Trees.Performance Characteristics Of Bsts.Index Implementations With Symbol Tables.Insertion At The Root In Bsts.Bst Implementations Of Other Adt Functions.Balanced Trees.Randomized Bsts.Splay Bsts.Top-Down 2-3-4 Trees.Red-Black Trees.Skip Lists.Performance Characteristics.Hashing.Hash Functions. Codice libro della libreria ABE_book_new_0201314525
Descrizione libro Prentice Hall, 1997. PAP. Condizione libro: New. New Book. Shipped from UK within 10 to 14 business days. Established seller since 2000. Codice libro della libreria PJ-9780201314526
Descrizione libro Prentice Hall. Condizione libro: New. Brand New. Codice libro della libreria 0201314525