Computer Algorithms, Introduction to Design and Analysis

The aim of this book is to understand: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation - Big oh notation, Omega notation, The ta notation and Little oh notation, Probabilistic analysis, Amortized analysis. Searching and Traversal Techniques: Efficient non - recursive binary tree traversal algorithm, Disjoint set operations, union and find algorithms, Spanning trees.