Algorithms in C++: parts 1-4

Fundamentals, data structures, sorting, searching

Robert Sedgewick

720 pages, parution le 03/09/1998

Ajouter à une liste

Indisponible

Résumé

This text on algorithms and data structures develops C++ implementations that express methods in a concise manner, and provides students with practical means to test C++ on real applications. It covers: fundamental data structures and algorithms for sorting, searching and related applications; and arrays, linked lists, strings, trees and other basic data structures. Included are algorithms for sorting, selection, priority queue ADT implementations and symbol table ADT (searching) implementations, and exercises to help students learn the properties of algorithms.

Table of contents :

1 Introduction ..... 3
2 Principles of Algorithm Analysis ..... 27
3 Elementary Data Structures ..... 69
4 Abstract Data Types ..... 129
5 Recursion and Trees ..... 201
6 Elementary Sorting Methods ..... 265
7 Quicksort ..... 315
8 Merging and Mergesort ..... 347
9 Priority Queues and Heapsort ..... 373
10 Radix Sorting ..... 417
11 Special-Purpose Sorts ..... 451
12 Symbol Tables and BSTs ..... 489
13 Balanced Trees ..... 543
14 Hashing .... 587
15 Radix Search .... 623
16 External Searching .... 669
Index ..... 707