|Mis en vente dans la catégorie :
Vous en avez un à vendre ?

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

État :
Bon état
Satisfaction Guaranteed! 100% Money Back Guarantee.Book is in typical used-Good Condition. Will show ... En savoir plusà propos de l'état
Prix :
37,91 USD
Environ35,32 EUR
Livraison :
3,97 USD (environ 3,70 EUR) Economy Shipping. Afficher les détailspour la livraison
Lieu où se trouve l'objet : Multiple Locations, États-Unis
Délai de livraison :
Estimé entre le ven. 14 juin et le jeu. 20 juin à 43230
Les délais de livraison sont estimés au moyen de notre méthode exclusive basée sur la distance entre l'acheteur et le lieu où se trouve l'objet, le service de livraison sélectionné, l'historique des livraisons du vendeur et d'autres facteurs. Les délais de livraison peuvent varier, notamment pendant les périodes de pointe.
Retours :
Retour sous 30 jours. Le vendeur paie les frais de retour. Afficher les détails- pour en savoir plus sur les retours
Paiements :
     

Achetez en toute confiance

Vendeur Top Fiabilité
Vendeur de confiance, livraison rapide et retours facilités. 
Garantie client eBay
Obtenez un remboursement si vous ne recevez pas l'objet que vous avez commandé. 

Détails 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 le 09 juin 2024 08:41:46 CEST. Afficher toutes les modificationsAfficher toutes les modifications

Caractéristiques de l'objet

État
Bon état
Livre ayant déjà été lu, mais qui est toujours en bon état. La couverture présente des dommages mineurs, comme des éraflures, mais n'est ni trouée ni déchirée. Pour les couvertures rigides, la jaquette n'est pas nécessairement incluse. La reliure présente des marques d'usure mineures. La majorité des pages sont intactes. Pliures et déchirures mineures. Soulignement de texte mineur au crayon. Aucun surlignement de texte. Aucune note dans les marges. Aucune page manquante. Consulter l'annonce du vendeur pour avoir plus de détails et voir la description des défauts. Afficher toutes les définitions des étatsla page s'ouvre dans une nouvelle fenêtre ou un nouvel onglet
Commentaires 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 fournie par le vendeur

Informations sur le vendeur professionnel

Ali Abd Elhamid
ADAM AFROTO
Egypt
Afficher les coordonnées
: liam-e esserdAmoc.liamg@438madaotorfa
Je certifie que toutes mes activités de vente seront conformes à toutes les lois et réglementations de l'UE.
AMA - BOOKS

AMA - BOOKS

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

Évaluations détaillées du vendeur

Moyenne pour les 12 derniers mois

Description exacte
4.8
Frais de livraison raisonnables
4.8
Livraison rapide
4.9
Communication
4.8
Inscrit comme vendeur professionnel

Évaluations en tant que vendeur (4.015)

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