9780201314526 - algorithms in c, parts 1-4: fundamentals, data structures, sorting, searching: fundamentals, data structures, sorting, searching (3rd edition) (pts. 1-4) di sedgewick, robert (23 risultati)
- Brossura
Da: clickgoodwillbooks, Indianapolis, IN, U.S.A.clickgoodwillbooks
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Discreto
EUR 13,49
EUR 3,45 spedizioneSpedito in U.S.A.Quantità: 2 disponibili
Condizione: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media.
- Brossura
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.ThriftBooks-Dallas
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 17,04
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
- Brossura
Da: Goodwill of Silicon Valley, SAN JOSE, CA, U.S.A.Goodwill of Silicon Valley
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 17,04
EUR 3,45 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear.
- Brossura
Da: Solr Books, Lincolnwood, IL, U.S.A.Solr Books
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 17,04
EUR 6,89 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: good. This book is in Good condition. There may be some notes and highligting but otherwise the book is in overall good condition.
- Brossura
Da: Better World Books: West, Reno, NV, U.S.A.Better World Books: West
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 28,43
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Condizione: Good. 3rd Edition. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
- Brossura
Da: GoldBooks, Denver, CO, U.S.A.GoldBooks
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 71,91
EUR 4,75 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. New Copy. Customer Service Guaranteed.
- Brossura
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.BennettBooksLtd
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 83,42
EUR 6,00 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
paperback. Condizione: New. In shrink wrap. Looks like an interesting title.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 101,93
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 104,28
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This product contains Parts 1-4 only 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 incl…udes 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 volume, Parts 1-4, provides coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Brossura
Da: Ubiquity Trade, Miami, FL, U.S.A.Ubiquity Trade
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 103,20
EUR 2,59 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Brand new! Please provide a physical shipping address.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 106,71
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 97,82
EUR 17,38 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: Russell Books, Victoria, BC, CanadaRussell Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 108,10
EUR 17,27 spedizioneSpedito da Canada a U.S.A.Quantità: Più di 20 disponibili
Softcover. Condizione: New. Special order direct from the distributor.
- Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 116,53
EUR 10,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. "Algorithms in C" is a book suitable even for an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, to be able to pick up and get a lot out of. Num Pages: 720 pages, diagram. BIC Classification: UMX; UYA. Category: (U) Tertiary Education (US: College). Dimension: 233 x 20…1 x 38. Weight in Grams: 1241. . 1997. 3 Rev ed. Paperback. . . . .
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 115,53
EUR 17,38 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 67,75
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching | Robert Sedgewick | Taschenbuch | 720 S. | Englisch | 1997 | Pearson International | EAN 9780201314526 | Verantwortliche Person für die EU: Pearson Studium im Verlag Pearson Benelux B.V. Zweigniederla, Sankt-Martin-Str. 8…2, 81541 München, buchhandel[at]pearson[dot]com | Anbieter: preigu.
- Brossura
Da: Revaluation Books, Exeter, , Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 133,91
EUR 17,38 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 3rd edition. 702 pages. 9.50x7.75x1.25 inches. In Stock.
- Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 145,20
EUR 9,07 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New. "Algorithms in C" is a book suitable even for an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, to be able to pick up and get a lot out of. Num Pages: 720 pages, diagram. BIC Classification: UMX; UYA. Category: (U) Tertiary Education (US: College). Dimension: 233 x 20…1 x 38. Weight in Grams: 1241. . 1997. 3 Rev ed. Paperback. . . . . Books ship from the US and Ireland.
- Brossura
Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 159,51
EUR 31,97 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This product contains Parts 1-4 only 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 incl…udes 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 volume, Parts 1-4, provides coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Lingua: Inglese
Editore: Pearson International, FT Publishing International Sep 1997 1997
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 81,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -'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. 720 pp. Englisch.
- Brossura
- Print on Demand
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 65,28
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Über den AutorRobert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA.… He earned his Ph.D .
Lingua: Inglese
Editore: Pearson International, FT Publishing International Sep 1997 1997
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 81,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -'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 Sed…gewick 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.Financial Times Prent., St.-Martin-Straße 82, 81541 München 720 pp. Englisch.
Lingua: Inglese
Editore: Pearson International, FT Publishing International 1997
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 82,82
EUR 66,74 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - '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 Sedg…ewick 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.
