|Aangeboden in rubriek:
Hebt u iets om te verkopen?

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

Objectstaat:
Goed
Satisfaction Guaranteed! 100% Money Back Guarantee.Book is in typical used-Good Condition. Will show ... Meer lezenover objectstaat
Prijs:
US $37,91
OngeveerEUR 35,35
Verzendkosten:
US $3,97 (ongeveer EUR 3,70) Economy Shipping. Details bekijkenvoor verzending
Bevindt zich in: Multiple Locations, Verenigde Staten
Levering:
Geschatte levering tussen ma, 17 jun en za, 22 jun tot 43230
De levertijd wordt geschat met onze eigen methode op basis van onder meer de nabijheid van de koper ten opzichte van de objectlocatie, de geselecteerde verzendservice, en de verzendgeschiedenis van de verkoper. De leveringstermijnen kunnen variëren, vooral gedurende piekperiodes.
Retourbeleid:
30 dagen om te retourneren. Verkoper betaalt voor retourzending. Details bekijken- voor meer informatie over retourzendingen
Betalingen:
     

Winkel met vertrouwen

eBay-topverkoper
Betrouwbare verkoper, snelle verzending en eenvoudige retourzending. 
Geld-terug-garantie van eBay
Ontvang het object dat u hebt besteld of krijg uw geld terug. 

Verkopergegevens

Ingeschreven als zakelijke verkoper
De verkoper neemt de volledige verantwoordelijkheid voor deze aanbieding.
eBay-objectnummer:285477395804
Laatst bijgewerkt op 09 jun 2024 08:41:46 CESTAlle herzieningen bekijkenAlle herzieningen bekijken

Specificaties

Objectstaat
Goed
Een boek dat is gelezen, maar zich in goede staat bevindt. De kaft is zeer minimaal beschadigd (er zijn bijvoorbeeld slijtplekken), maar er zijn geen deukjes of scheuren. De harde kaft heeft mogelijk geen stofomslag meer. De boekband vertoont minimale slijtage. De meeste bladzijden zijn onbeschadigd. Er zijn weinig vouwen en scheuren en er is vrijwel geen tekst met potlood onderstreept of met een accentueerstift gemarkeerd. Er is niet in de kantlijn geschreven. Er ontbreken geen bladzijden. Bekijk de aanbieding van de verkoper voor de volledige details en een beschrijving van gebreken. Alle staatdefinities bekijkenwordt in nieuw venster of op nieuw tabblad geopend
Opmerkingen van verkoper
“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

Over dit 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
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

Objectbeschrijving van de verkoper

Informatie van zakelijke verkoper

Ali Abd Elhamid
ADAM AFROTO
Egypt
Contactgegevens weergeven
:liam-Emoc.liamg@438madaotorfa
Ik verklaar dat al mijn verkoopactiviteiten zullen voldoen aan alle wet- en regelgeving van de EU.
AMA - BOOKS

AMA - BOOKS

96,6% positieve feedback
24K objecten verkocht

Gedetailleerde verkopersbeoordelingen

Gemiddelde van de afgelopen 12 maanden

Nauwkeurige beschrijving
4.8
Redelijke verzendkosten
4.8
Verzendtijd
4.9
Communicatie
4.8
Ingeschreven als zakelijke verkoper

Feedback verkoper (4.015)

1***0 (61)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
As descibed
p***e (174)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
👍🏻
2***3 (893)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
Beautiful Oska pants, swiftly sent--thanks!