Algorithms in C++
This version of Sedgewick's bestselling book provides a comprehensive collection of algorithms implemented in C++. The algorithms included cover a broad range of fundamental and more advanced methods: sorting, searching, string processing, geometric, graph, and mathematical algorithms. Readers will discover-in an object-oriented programming environment-how key algorithms can be implemented, run, debugged, and used in real applications.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
adjacency list algorithm applications array basic binary search tree binary tree bits breadth-first search Chapter character coefficients comparisons complicated connected components consider convex hull corresponding data structure delete depth-first search described directed graph disk edges efficient element encoding equations example external nodes fundamental geometric given graph heap implementation inner loop input insertion sort integer intersection involved itemType keys large number linear program linked list machine match mathematical matrix merge Mergesort method minimum spanning tree multiplications nonrecursive operations output partitioning path pattern performance pointer polygon polynomial priority queue problem procedure processors Property Quicksort radix sort random numbers records rectangle recursive recursive calls recursive program representation represented result running scan sequence shown in Figure simple simplex solution solve stack steps string struct node subfiles subtree t->next tape techniques traversal variables vertex vertices