This ebook aims to be an accessible introduction into the design and analysis of efficient algorithms. Throughout the ebook we will introduce only the most basic techniques and describe the rigorous mathematical methods needed to analyze them.

The topics covered include:

? The divide and conquer technique.
? The use of randomization in algorithms.
? The general, but typically inefficient, backtracking technique.
? Dynamic programming as an efficient optimization for some backtracking algorithms.
? Greedy algorithms as an optimization of other kinds of backtracking algorithms.
? Hill-climbing techniques, including network flow.

The goal of the ebook is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

Topics covered:
? Sorting-bubble sort
? Mathematical Background
? Backtracking
? Find approximate maximum
? Hill Climbing
? Divide and Conquer
? Left rotation
? Unweighted Graph Algorithms
? Distance approximations
? Dynamic Programming
? Find maximum
? Randomization
? Greedy Algorithms
? Ada Implementation

You need Alphonso EBook Viewer to view this EBook. You will be prompted to download it for FREE when you open EBook. You can also download it from Google Play at https://play.google.com/store/apps/details?id=code.alphonso.android.bookviewer

Visit Blog: http://alphonsosofttech.blogspot.com/
EBooks Catalog: http://alphonsosofttech.blogspot.com/p/alphonso-ebooks-catalog.html

EBook Blog: http://alphonsosofttech.blogspot.com/2012/12/algorithms-ebook-launched.html