Atjaunināt sīkdatņu piekrišanu

E-grāmata: Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching

  • Formāts: 752 pages
  • Izdošanas datums: 13-Jul-1998
  • Izdevniecība: Addison Wesley
  • Valoda: eng
  • ISBN-13: 9780768684766
  • Formāts - PDF+DRM
  • Cena: 50,71 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
  • Formāts: 752 pages
  • Izdošanas datums: 13-Jul-1998
  • Izdevniecība: Addison Wesley
  • Valoda: eng
  • ISBN-13: 9780768684766

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications.

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 1n4, 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. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.

Highlights
  • Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
  • Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes 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, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more
  • Increased quantitative information about the algorithms, giving you a basis for comparing them
  • Over 1000 new exercises to help you learn the properties of algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

Fundamentals
Introduction
3(24)
Algorithms
4(3)
A Sample Problem---Connectivity
7(4)
Union-Find Algorithms
11(11)
Perspective
22(2)
Summary of Topics
24(3)
Principles of Algorithm Analysis
27(42)
Implementation and Empirical Analysis
28(5)
Analysis of Algorithms
33(3)
Growth of Functions
36(8)
Big-Oh Notation
44(5)
Basic Recurrences
49(4)
Examples of Algorithm Analysis
53(6)
Guarantees, Predictions, and Limitations
59(10)
Data Structures
Elementary Data Structures
69(60)
Building Blocks
70(13)
Arrays
83(8)
Linked Lists
91(6)
Elementary List Processing
97(9)
Memory Allocation for Lists
106(4)
Strings
110(6)
Compound Data Structures
116(13)
Abstract Data Types
129(72)
Abstract Objects and Collections of Objects
140(4)
Pushdown Stack ADT
144(3)
Examples of Stack ADT Clients
147(6)
Stack ADT Implementations
153(5)
Creation of a New ADT
158(8)
FIFO Queues and Generalized Queues
166(9)
Duplicate and Index Items
175(4)
First-Class ADTs
179(13)
Application-Based ADT Example
192(6)
Perspective
198(3)
Recursion and Trees
201(64)
Recursive Algorithms
202(8)
Divide and Conquer
210(12)
Dynamic Programming
222(8)
Trees
230(10)
Mathematical Properties of Trees
240(3)
Tree Traversal
243(6)
Recursive Binary-Tree Algorithms
249(6)
Graph Traversal
255(6)
Perspective
261(4)
Sorting
Elementary Sorting Methods
265(50)
Rules of the Game
267(6)
Selection Sort
273(1)
Insertion Sort
274(3)
Bubble Sort
277(2)
Performance Characteristics of Elementary Sorts
279(6)
Shellsort
285(8)
Sorting Other Types of Data
293(6)
Index and Pointer Sorting
299(8)
Sorting Linked Lists
307(5)
Key-Indexed Counting
312(3)
Quicksort
315(32)
The Basic Algorithm
316(5)
Performance Characteristics of Quicksort
321(4)
Stack Size
325(3)
Small Subfiles
328(3)
Median-of-Three Partitioning
331(5)
Duplicate Keys
336(3)
Strings and Vectors
339(2)
Selection
341(6)
Merging and Mergesort
347(26)
Two-Way Merging
348(3)
Abstract In-Place Merge
351(2)
Top-Down Mergesort
353(4)
Improvements to the Basic Algorithm
357(2)
Bottom-Up Mergesort
359(4)
Performance Characteristics of Mergesort
363(3)
Linked-List Implementations of Mergesort
366(4)
Recursion Revisited
370(3)
Priority Queues and Heapsort
373(44)
Elementary Implementations
377(4)
Heap Data Structure
381(2)
Algorithms on Heaps
383(6)
Heapsort
389(7)
Priority-Queue ADT
396(6)
Priority Queues for Index Items
402(4)
Binomial Queues
406(11)
Radix Sorting
417(34)
Bits, Bytes, and Words
419(4)
Binary Quicksort
423(4)
MSD Radix Sort
427(8)
Three-Way Radix Quicksort
435(4)
LSD Radix Sort
439(3)
Performance Characteristics of Radix Sorts
442(5)
Sublinear-Time Sorts
447(4)
Special-Purpose Sorts
451(38)
Batcher's Odd-Even Mergesort
453(5)
Sorting Networks
458(8)
External Sorting
466(6)
Sort-Merge Implementations
472(6)
Parallel Sort/Merge
478(11)
Searching
Symbol Tables and BSTs
489(54)
Symbol-Table Abstract Data Type
491(8)
Key-Indexed Search
499(3)
Sequential Search
502(8)
Binary Search
510(5)
Binary Search Trees (BSTs)
515(6)
Performance Characteristics of BSTs
521(4)
Index Implementations with Symbol Tables
525(4)
Insertion at the Root in BSTs
529(4)
BST Implementations of Other ADT Functions
533(10)
Balanced Trees
543(44)
Randomized BSTs
547(7)
Splay BSTs
554(6)
Top-Down 2-3-4 Trees
560(5)
Red-Black Trees
565(10)
Skip Lists
575(8)
Performance Characteristics
583(4)
Hashing
587(36)
Hash Functions
588(9)
Separate Chaining
597(5)
Linear Probing
602(6)
Double Hashing
608(5)
Dynamic Hash Tables
613(4)
Perspective
617(6)
Radix Search
623(46)
Digital Search Trees
624(4)
Tries
628(9)
Patricia Tries
637(9)
Multiway Tries and TSTs
646(18)
Text String Index Applications
664(5)
External Searching
669(38)
Rules of the Game
671(3)
Indexed Sequential Access
674(2)
B Trees
676(15)
Extendible Hashing
691(12)
Perspective
703(4)
Index 707


Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

Christopher J. Van Wyk is Professor of Mathematics and Computer Science at Drew University. The author of Data Structures and C Programs (Addison-Wesley, 1988), he has served on the research staff at Bell Laboratories, where he is now a consultant. Robert Sedgewick and Christopher Van Wyk both earned their Ph.D. degrees from Stanford University under Donald E. Knuth.





0201350882AB06262002