Publisher's Synopsis
As there can be more than one algorithm for the same problem, designing and analyzing an algorithm becomes important in order to make it as efficient and robust as possible. This book will serve as a guide to design and analysis of computer algorithms. Chapter One provides an overview of different algorithm design techniques and the various applications of such techniques. Chapter Two reviews the divide and conquer strategy and the algorithm types that employ it. Chapter Three explores greedy algorithms and some problems that can be solved with this approach. Chapter Four discusses in depth the dynamic programming approach. Chapter Five provides a solution to the N-Queens problem utilizing a backtracking approach. Chapter Six elucidates the reader to branch and bound techniques and provides three solutions to problems implementing them. Part II of this book begins with Chapter Seven, where two different approaches to the analysis of algorithms are discussed. Chapter Eight reviews randomized algorithms through an empirical lens. Chapter Nine discusses Master Theorem and the many kinds of problems this Theorem can solve. Chapter Ten, the final chapter, provides notes on the empirical complexity analysis of algorithms.
