Order Total (1 Item Items):
Shipping Destination:
Introduction Data Structures Algorithms by Storer J a (33 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (33)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (13)
- Not Print on Demand (30)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.85.
-
An Introduction to Data Structures and Algorithms
Seller: Bay State Book Company, North Smithfield, RI, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: New. pp. 620.
-
US$ 42.00
Convert currencyUS$ 8.88 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. pp. 620 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.
-
Condition: Good. [ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Edition: reprint ] Publisher: Springer Pub Date: 1/1/2002 Binding: Paperback Pages: 553 reprint edition.
-
US$ 50.58
Convert currencyUS$ 11.71 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. pp. 620.
-
Condition: New.
-
US$ 60.52
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 60.77
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
An Introduction to Data Structures and Algorithms
Published by Springer-Verlag New York Inc., 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Language: English
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Condition: As New. Unread book in perfect condition.
-
An Introduction to Data Structures and Algorithms
Published by Springer-Verlag New York Inc., 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 58.21
Convert currencyUS$ 10.43 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Introduction to Data Structures and Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 58.20
Convert currencyUS$ 20.50 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketCondition: New.
-
An Introduction to Data Structures and Algorithms
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 64.95
Convert currencyUS$ 16.37 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
An Introduction to Data Structures and Algorithms
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
US$ 74.94
Convert currencyUS$ 12.36 shipping from Ireland to U.S.A.Quantity: 2 available
Add to basketCondition: New. 2012. Paperback. . . . . .
-
An Introduction to Data Structures and Algorithms
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 71.54
Convert currencyUS$ 16.37 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
An Introduction to Data Structures and Algorithms
Published by Springer-Verlag New York Inc., US, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 4 out of 5 stars
US$ 93.10
Convert currencyFree shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel Softcover reprint of the original 1st ed. 2002.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Condition: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
-
An Introduction to Data Structures and Algorithms
Published by Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Language: English
US$ 73.32
Convert currencyUS$ 39.70 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Data structures and algorithms are presented at the college levelin a highly accessible format that presents material with one-pagedisplays in a way that will appeal to both teachers and students. Thethirteen chapters cover: Models of Computation, Lists, Induction andRecursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees,Sets Over a Small Universe, Graphs, Strings, Discrete FourierTransform, Parallel Computation.Key features: Complicated concepts are expressed clearly in asingle page with minimal notation and without the 'clutter' of thesyntax of a particular programming language; algorithms are presentedwith self-explanatory 'pseudo-code.' \* Chapters 1-4 focus onelementary concepts, the exposition unfolding at a slower pace. Sampleexercises with solutions are provided. Sections that may be skippedfor an introductory course are starred. Requires only some basicmathematics background and some computer programming experience. \*Chapters 5-13 progress at a faster pace. The material is suitable forundergraduates or first-year graduates who need only review Chapters 1-4. \* This book may be used for a one-semester introductory course(based on Chapters 1-4 and portions of the chapters on algorithmdesign, hashing, and graph algorithms) and for a one-semester advancedcourse that starts at Chapter 5. A year-long course may be based onthe entire book. \* Sorting, often perceived as rather technical, isnot treated as a separate chapter, but is used in many examples(including bubble sort, merge sort, tree sort, heap sort, quick sort,and several parallel algorithms). Also, lower bounds on sorting bycomparisons are included with the presentation of heaps in the contextof lower bounds for comparison-based structures. \* Chapter 13 onparallel models of computation is something of a mini-book itself, anda good way to end a course. Although it is not clear what parallel.
-
US$ 100.35
Convert currencyUS$ 13.67 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
-
US$ 98.01
Convert currencyUS$ 21.17 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPF. Condition: New.
-
US$ 70.13
Convert currencyUS$ 57.67 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketCondition: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists,.
-
US$ 82.37
Convert currencyUS$ 57.67 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists,.
-
Introduction to Data Structures and Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 119.65
Convert currencyUS$ 20.50 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 108.40
Convert currencyUS$ 34.17 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
An Introduction to Data Structures and Algorithms
Published by Birkhauser Boston Nov 2001, 2001
ISBN 10: 0817642536 ISBN 13: 9780817642532
Language: English
US$ 104.25
Convert currencyUS$ 40.52 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: Neu. Neuware - Data structures and algorithms are presented at the college levelin a highly accessible format that presents material with one-pagedisplays in a way that will appeal to both teachers and students. Thethirteen chapters cover: Models of Computation, Lists, Induction andRecursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees,Sets Over a Small Universe, Graphs, Strings, Discrete FourierTransform, Parallel Computation.Key features: Complicated concepts are expressed clearly in asingle page with minimal notation and without the 'clutter' of thesyntax of a particular programming language; algorithms are presentedwith self-explanatory 'pseudo-code.' \* Chapters 1-4 focus onelementary concepts, the exposition unfolding at a slower pace. Sampleexercises with solutions are provided. Sections that may be skippedfor an introductory course are starred. Requires only some basicmathematics background and some computer programming experience. \*Chapters 5-13 progress at a faster pace. The material is suitable forundergraduates or first-year graduates who need only review Chapters 1-4. \* This book may be used for a one-semester introductory course(based on Chapters 1-4 and portions of the chapters on algorithmdesign, hashing, and graph algorithms) and for a one-semester advancedcourse that starts at Chapter 5. A year-long course may be based onthe entire book. \* Sorting, often perceived as rather technical, isnot treated as a separate chapter, but is used in many examples(including bubble sort, merge sort, tree sort, heap sort, quick sort,and several parallel algorithms). Also, lower bounds on sorting bycomparisons are included with the presentation of heaps in the contextof lower bounds for comparison-based structures. \* Chapter 13 onparallel models of computation is something of a mini-book itself, anda good way to end a course. Although it is not clear what parallel.
-
An Introduction to Data Structures and Algorithms
Published by Springer-Verlag New York Inc., US, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Language: English
US$ 86.83
Convert currencyUS$ 88.84 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel Softcover reprint of the original 1st ed. 2002.
