## Analysis of AlgorithmsUpdated to follow the recommendations put forth by the ACM/SIGCSE 2001 task force, Analysis of Algorithms raises awareness of the effects that algorithms have on the efficiency of a program and develops the necessary skills to analyze general algorithms used in programs. The text presents the material with the expectation that it can be used with active and cooperative learning methodology, based on the premise that students learn more effectively and retain more information longer when they are active participants in the learning process. To accomplish this, the chapters are clear and complete to encourage students to prepare by reading before class, and the text is filled with exciting examples and exercises that look at the efficiency of various algorithms to solve a problem. The author is well known for workshops that he presents on the active learning model. He has written an instructor's manual that helps instructors understand how to present the material in an active way. |

### What people are saying - Write a review

User Review - Flag as inappropriate

Elegant Content, very lucid language. Wonderful cover design and great quality of pages. I just gone through in flow while reading this book completed in 2 sitting . Kudos to Mr. McConnell

### Contents

Analysis Basics | 1 |

Recursive Algorithms | 29 |

Searching and Selection Algorithms | 59 |

Sorting Algorithms | 77 |

Numeric Algorithms | 131 |

Formal Language Algorithms | 147 |

a Program | 163 |

Matching Algorithms | 211 |

Parallel Algorithms | 267 |

Limits of Computation | 303 |

Other Algorithmic Techniques | 355 |

Appendix A Pseudorandom Number Table | 399 |

Results of Chapter Study Suggestions | 409 |

429 | |

435 | |

Graph Algorithms | 231 |

### Common terms and phrases

accepting adjacency matrix answer automata backpack begin biconnected components bubble sort calculate chapter characters class NP consider context-free convex hull create cycle depth-first determine deterministic finite automaton edge element encoding end if end equation example EXERCISES FIGURE gives grammar graph heap increment insertion sort language largest value look loop match matrix multiplication means merge method minimum spanning tree move node nondeterministic finite nondeterministic finite automaton nonterminal symbols number of comparisons operations optimal parallel parse tree pass pattern permutations pivot points polynomial possible problem processors pushdown automaton Quicksort read—write head recurrence relation recursive algorithm result rithm rules Section sequential shellsort shortest path smaller smallest solution solve sorting algorithm stack step subprogram subset substring swap tape target terminal symbols textLoc tion traversal Turing machine word worst write