|Listed in category:
Have one to sell?

Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching�

US $20.01
Condition:
Good
Satisfaction Guaranteed! 100% Money Back Guarantee.Book is in typical used-Good Condition. Will show ... Read moreabout condition
Breathe easy. Returns accepted.
Shipping:
US $3.97 Economy Shipping. See detailsfor shipping
Located in: Multiple Locations, United States
Delivery:
Estimated between Thu, May 23 and Tue, May 28 to 43230
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days returns. Seller pays for return shipping. See details- for more information about returns
Payments:
      
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:285477395804
Last updated on May 18, 2024 14:41:13 PDTView all revisionsView all revisions

Item specifics

Condition
Good
A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages. See the seller’s listing for full details and description of any imperfections. See all condition definitionsopens in a new window or tab
Seller Notes
“Satisfaction Guaranteed! 100% Money Back Guarantee.Book is in typical used-Good Condition. Will ...
Book Title
Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sor�
Subject
Systems Analysis & Design
Narrative Type
Systems Analysis & Design
Genre
COMPUTERS
Intended Audience
N/A
ISBN
9780201314526
Publication Name
Algorithms in C, Parts 1-4 Pts. 1-4 : Fundamentals, Data Structures, Sorting, Searching
Item Length
9.2in
Publisher
Addison Wesley Professional
Publication Year
1997
Type
Textbook
Format
Trade Paperback
Language
English
Item Height
2.2in
Author
Robert Sedgewick
Features
Revised
Item Width
7.8in
Item Weight
45.2 Oz
Number of Pages
720 Pages

About this product

Product Information

"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.

Product Identifiers

Publisher
Addison Wesley Professional
ISBN-10
0201314525
ISBN-13
9780201314526
eBay Product ID (ePID)
1055569

Product Key Features

Author
Robert Sedgewick
Publication Name
Algorithms in C, Parts 1-4 Pts. 1-4 : Fundamentals, Data Structures, Sorting, Searching
Format
Trade Paperback
Language
English
Features
Revised
Publication Year
1997
Type
Textbook
Number of Pages
720 Pages

Dimensions

Item Length
9.2in
Item Height
2.2in
Item Width
7.8in
Item Weight
45.2 Oz

Additional Product Features

Lc Classification Number
Qa76.73.C15s43 1998
Edition Description
Revised Edition
Edition Number
3
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
Copyright Date
1998
Topic
Programming / Algorithms, Software Development & Engineering / Systems Analysis & Design
Lccn
97-023418
Dewey Decimal
005.13/3
Intended Audience
Scholarly & Professional
Dewey Edition
21
Illustrated
Yes
Genre
Computers

Item description from the seller

AMA - BOOKS

AMA - BOOKS

96.7% positive feedback
24K items sold
Joined Jul 2018

Detailed seller ratings

Average for the last 12 months

Accurate description
4.8
Reasonable shipping cost
4.8
Shipping speed
4.9
Communication
4.8

Seller feedback (3,957)

5***i (33)- Feedback left by buyer.
Past month
Verified purchase
Item came as described! $4 shipping it should have come a little faster but experience was good. Will do business again with this seller!
o***l (17)- Feedback left by buyer.
Past month
Verified purchase
Excellent seller, response and fast shipping. Product exactly as advertised. I recommend it to everyone.
n***5 (182)- Feedback left by buyer.
Past 6 months
Verified purchase
Bought and paid for the book. Seller said it was damaged and they would find another. Then I received a shipping notice. When it didn’t arrive when they said, I waited a week and contacted seller. Received a quick refund. Now it is listed again for twice the price. This seller is a ripoff artist and should be banned from eBay.

Product ratings and reviews

4.0
2 product ratings
  • 1 users rated this 5 out of 5 stars
  • 0 users rated this 4 out of 5 stars
  • 1 users rated this 3 out of 5 stars
  • 0 users rated this 2 out of 5 stars
  • 0 users rated this 1 out of 5 stars

Most relevant reviews

  • The paper and print looks being reprinted.

    The paper and print looks being reprinted. The quality isn't as good as the C++ version I bought.

    Verified purchase: YesCondition: Pre-OwnedSold by: textbooks_source