Order Total (1 Item Items):
Shipping Destination:
Introduction Data Structures Algorithms by Storer J a (36 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (36)
- 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 Learn more
- New (29)
- As New, Fine or Near Fine (2)
- Very Good or Good (5)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
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 (12)
- Not Print on Demand (30)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
hardcover. Condition: Very Good. Grade 3 out 5 points. This is a used book. Book has wear on cover and pages. May have personalized notes/names, stickers/labels. Has no markings on pages. May not include extra materials like access codes, CDs, accessories, etc. All orders ship by next business day! We are a small company and very thankful for your business!
-
Condition: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item for full refund. Ships USPS Media Mail.
-
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!
-
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 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Condition: New. pp. 620.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Condition: New. pp. 620.
-
Condition: New.
-
Condition: New.
-
Condition: New.
-
Condition: As New. Unread book in perfect condition.
-
An Introduction to Data Structures and Algorithms
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 49.30
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
An Introduction to Data Structures and Algorithms
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 49.30
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
PF. Condition: New.
-
Introduction to Data Structures and Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Introduction to Data Structures and Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Condition: New. pp. 620.
-
An Introduction to Data Structures and Algorithms
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 2012. Paperback. . . . . .
-
An Introduction to Data Structures and Algorithms
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 2001. Hardcover. . . . . .
-
Condition: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
-
Condition: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.
-
Paperback. Condition: Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
-
Gebunden. 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,.
-
An Introduction to Data Structures and Algorithms
Language: English
Published by Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Taschenbuch. 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.
-
An Introduction to Data Structures and Algorithms
Language: English
Published by Birkhauser Boston Nov 2001, 2001
ISBN 10: 0817642536 ISBN 13: 9780817642532
Buch. 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.
