Vous en avez un à vendre?

Algorithmes en C, parties 1-4 : fondamentaux, structures de données, tri, recherche

État :
Bon
Satisfaction Guaranteed! 100% Money Back Guarantee.Book is in typical used-Good Condition. Will show ... En savoir plussur l'état
Prix :
37,91 $US
Environ52,22 $C
Ayez l'esprit tranquille. Renvois acceptés.
Expédition :
3,97 $US (environ 5,47 $C) Economy Shipping. En savoir plussur l'expédition
Lieu : Multiple Locations, États-Unis
Livraison :
Livraison prévue entre le lun. 17 juin et le sam. 22 juin à 43230
Le délai de livraison est estimé en utilisant notre méthode exclusive, basée sur la proximité de l'acheteur du lieu où se trouve l'objet, le service d'expédition sélectionné, l'historique d'expédition du vendeur et d'autres facteurs. Les délais de livraison peuvent varier, particulièrement lors de périodes achalandées.
Renvois :
Renvoi sous 30jours. Le vendeur paie les frais de renvoi. En savoir plus- pour en savoir plus sur les renvois
Paiements :
     

Magasinez en toute confiance

Garantie de remboursement eBay
Recevez l'objet commandé ou obtenez un remboursement. 

Informations sur le vendeur

Inscrit comme vendeur professionnel
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :285477395804
Dernière mise à jour : juin 09, 2024 02:41:46 HAEAfficher toutes les modificationsAfficher toutes les modifications

Caractéristiques de l'objet

État
Bon
Un livre qui a été lu, mais qui est en bon état. La couverture présente des dommages infimes, par exemple des éraflures, mais aucun trou ni aucune déchirure. Dans le cas des livres à reliure, la jaquette peut ne pas être incluse. La reliure présente des traces d'usure minimes. La plupart des pages ne sont pas endommagées et les plis, les déchirures, les passages soulignés ou surlignés et les inscriptions en marge sont minimes. Il n'y a aucune page manquante. Afficher toutes les définitions d'état(s'ouvre dans une nouvelle fenêtre ou un nouvel onglet)
Remarques du vendeur
“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�
Narrative Type
Systems Analysis & Design
Genre
COMPUTERS
Intended Audience
N/A
ISBN
9780201314526
Subject Area
Computers
Publication Name
Algorithms in C, Parts 1-4 Pts. 1-4 : Fundamentals, Data Structures, Sorting, Searching
Item Length
9.2 in
Publisher
Addison Wesley Professional
Subject
Programming / Algorithms, Software Development & Engineering / Systems Analysis & Design
Publication Year
1997
Type
Textbook
Format
Trade Paperback
Language
English
Item Height
2.2 in
Author
Robert Sedgewick
Features
Revised
Item Width
7.8 in
Item Weight
45.2 Oz
Number of Pages
720 Pages

À propos de ce produit

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
Subject
Programming / Algorithms, Software Development & Engineering / Systems Analysis & Design
Publication Year
1997
Type
Textbook
Subject Area
Computers
Number of Pages
720 Pages

Dimensions

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

Additional Product Features

Edition Number
3
LCCN
97-023418
Intended Audience
Scholarly & Professional
Lc Classification Number
Qa76.73.C15s43 1998
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
Copyright Date
1998
Dewey Decimal
005.13/3
Dewey Edition
21
Illustrated
Yes

Description de l'objet du vendeur

AMA - BOOKS

AMA - BOOKS

96,6% d'évaluations positives
24K objets vendus
Visiter la BoutiqueContacter

Évaluations détaillées du vendeur

Moyenne au cours des 12 derniers mois

Qualité de la description
4.8
Justesse des frais d'expédition
4.8
Rapidité de l'expédition
4.9
Communication
4.8

Évaluations comme vendeur (4 015)

1***0 (61)- Évaluation laissée par l'acheteur.
Dernier mois
Achat vérifié
As descibed
p***e (174)- Évaluation laissée par l'acheteur.
Dernier mois
Achat vérifié
👍🏻
2***3 (893)- Évaluation laissée par l'acheteur.
Dernier mois
Achat vérifié
Beautiful Oska pants, swiftly sent--thanks!

Évaluations et avis sur le produit

4.0
2 évaluations du produit
  • 1 utilisateurs ont attribué une note de 5 étoiles sur 5
  • 0 utilisateurs ont attribué une note de 4 étoiles sur 5
  • 1 utilisateurs ont attribué une note de 3 étoiles sur 5
  • 0 utilisateurs ont attribué une note de 2 étoiles sur 5
  • 0 utilisateurs ont attribué une note de 1 étoiles sur 5

Avis les plus pertinents

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

    Achat vérifié : OuiÉtat : OccasionVendu par : textbooks_source