Introduction to Algorithms: A Creative ApproachThis book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithm development. The heart of the creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design. 0201120372B04062001 |
Contents
Introduction | 1 |
Data Structures | 4 |
Mathematical Induction | 9 |
Copyright | |
15 other sections not shown
Common terms and phrases
algorithm to find arbitrary array assume augmenting path AVL tree begin end biconnected components binary search Boolean chapter clique problem colors compute Consider constant contains convex hull corresponding cycle data structure defined delete Design an algorithm DFS numbers efficient algorithm elements example Exercise Figure given in Fig graph G Gray code heap implies induction hypothesis input insert integer intersection length Let G lower bound matching matrix multiplication maximal maximum MCST mergesort minimal natural numbers node NP-complete number of comparisons number of edges O(n log Output parallel algorithms pointer points polygon polynomial possible processors proof prove quicksort recurrence relation reduction remove requires root running Section sequence shortest paths simple solution solve sorting spanning tree step straightforward Strassen's algorithm string strongly connected strongly connected component subgraph subproblems subset subtree techniques theorem total number undirected graph variables vertex cover weighted