Publisher's Synopsis
A computer algorithm is a set of instructions for performing calculation, data processing or automated reasoning. An initial state and input is provided, after which the algorithm proceeds through a succession of finite states to produce a final state and output. Algorithms may be classified on the basis of their implementation into recursive algorithm, logical algorithm, deterministic or non-deterministic algorithm, etc. They may also be classified as divide and conquer algorithm, search algorithm, randomized algorithm, etc. depending on the design paradigm or methodology. The study and analysis of algorithms is an important area of computer science. Algorithmic analysis is required to determine how much of a particular resource is required for a given algorithm. It is usually practiced without the implementation of a specific programming language. Most algorithms are applied on hardware/software platforms in which their algorithmic efficiency is evaluated using real code. For fast, interactive and commercial or scientific usage, algorithm efficiency is vital. The topics included in this book on computer algorithms are of utmost significance and bound to provide incredible insights to readers. Also included herein is a detailed explanation of the various aspects of the design, analysis and applications of algorithms. This book, with its detailed analyses and data, will prove immensely beneficial to professionals and students involved in this area at various levels.
