Foto 1 di 1
Galleria
Foto 1 di 1
Ne hai uno da vendere?
Algorithms in C, Parts 1-4: Fundamentals, Data Structures - Like New
US $19,99
CircaEUR 17,15
Condizione:
Nuovo
Libro nuovo, intatto e non letto, in perfette condizioni, senza pagine mancanti o danneggiate. Per maggiori dettagli, consulta l'inserzione del venditore.
- Compralo SubitoAlgorithms in C, Parts 1-4: Fundamentals, Data Structures - Like New
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Spedizione:
US $4,47 (circa EUR 3,84) USPS Media MailTM.
Oggetto che si trova a: Franklin Park, New Jersey, Stati Uniti
Consegna:
Consegna prevista tra il gio 23 ott e il mer 29 ott a 94104
Restituzioni:
Restituzioni non accettate.
Pagamenti:
Fai shopping in tutta sicurezza
Il venditore si assume la piena responsabilità della messa in vendita dell'oggetto.
Numero oggetto eBay:235960289095
Specifiche dell'oggetto
- Condizione
- Title
- Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorti
- ISBN
- 9780201314526
Informazioni su questo prodotto
Product Identifiers
Publisher
Addison Wesley Professional
ISBN-10
0201314525
ISBN-13
9780201314526
eBay Product ID (ePID)
1055569
Product Key Features
Number of Pages
720 Pages
Publication Name
Algorithms in C, Parts 1-4 Pts. 1-4 : Fundamentals, Data Structures, Sorting, Searching
Language
English
Subject
Programming / Algorithms, Software Development & Engineering / Systems Analysis & Design
Publication Year
1997
Features
Revised
Type
Textbook
Subject Area
Computers
Format
Trade Paperback
Dimensions
Item Height
1.5 in
Item Weight
44.4 Oz
Item Length
9.2 in
Item Width
7.8 in
Additional Product Features
Edition Number
3
Intended Audience
Scholarly & Professional
LCCN
97-023418
Dewey Edition
21
Illustrated
Yes
Dewey Decimal
005.13/3
Edition Description
Revised edition
Table Of Content
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. Separate Chaining. Linear Probing. Double Hashing. Dynamic Hash Tables. Perspective. Radix Searching. Digital Search Trees. Tries. Patricia. Multiway Tries And Tsts. Text String Index Applications. External Searching. Indexed Sequential Access. B-Trees. Extendable Hashing. Virtual Memory. Program Index. List Of Figures. Index. Epilogue. 0201314525T04062001
Synopsis
"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., Parts 1-4 of Robert Sedgewick's work provide extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. They reflect the third edition's greater emphasis on abstract data types (ADTs). Coverage includes more than 100 key algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations. Also included are new implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomised BSTs, splay trees, skip lists, and multiway tries. Increased quantitative information gives students a more solid basis for comparing algorithms, and hundreds of new exercises reinforce their learning. Algorithms and data structures described in the book are expressed in concise implementations in C, so that students can both appreciate their fundamental properties and test them on real applications., "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.
LC Classification Number
QA76.73.C15S43 1998
Descrizione dell'oggetto fatta dal venditore
Informazioni su questo venditore
web_user
100% di Feedback positivi•42 oggetti venduti
Registrato come venditore privatoPertanto non si applicano i diritti dei consumatori derivanti dalla normativa europea. La Garanzia cliente eBay è comunque applicabile alla maggior parte degli acquisti. Scopri di piùScopri di più
Feedback sul venditore (24)
- 1***n (3)- Feedback lasciato dall'acquirente.Ultimi 6 mesiAcquisto verificatoBook arrived quickly and in great condition. I would definitely consider this seller again!Inside Com (Microsoft Programming Series) - Paperback - Brand New (N° 235961776326)
- _***c (390)- Feedback lasciato dall'acquirente.Ultimi 6 mesiAcquisto verificatoSmooth transaction, authentic item, happy buyer, A+++ seller!INTERNETWORKING WITH TCP/IP VOL. III CLIENT-SERVER By Douglas E. Comer & David (N° 235960354881)
- m***r (239)- Feedback lasciato dall'acquirente.Ultimi 6 mesiAcquisto verificatoGreat service!Algorithms in C, Part 5: Graph - Paperback, by Sedgewick Robert - Like New (N° 236036447690)