## Introduction to algorithms: a creative approachThis book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithms development. The heart of this 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. |

### What people are saying - Write a review

#### Review: Introduction to Algorithms: A Creative Approach

User Review - Brad - GoodreadsUnlike other textbooks, this book is not just a catalog of algorithms. It teaches how to develop algorithms using the inductive or iterative method, similar to mathematical induction. Read full review

#### Review: Introduction to Algorithms: A Creative Approach

User Review - A941315 - GoodreadsThis book is good Read full review

### Related books

Introduction to Design & Analysis of Algorithms: For Anna University, 2/e Anany V. Levitin No preview available - 2009 |

### Common terms and phrases

algorithm to find arbitrary array assume augmenting path AVL tree biconnected components binary search Boolean chapter clique problem colors compute Consider constant contains convex hull corresponding cost cycle data structure defined delete denote Design an algorithm DFS numbers discussed efficient algorithm elements end Figure example Exercise given in Fig graph G Gray code heap induction hypothesis input insert integer intersection Let G logn lower bound matching matrix multiplication maximal maximum MCST mergesort minimal multiset node NP-complete number of comparisons number of edges operations Output parallel algorithm partition perform pointer points polygon polynomial possible Problem Given processors proof prove quicksort real numbers recurrence relation reduction remove requires root running satisfies Section sequence shortest paths simple solution solve sorting spanning tree straightforward strongly connected component subgraph subproblems subset subtree techniques theorem total number traversal undirected graph variables vertex cover weighted