Mastering Computer Algorithm is not only essential but also is the requirement for any computer expert. Without having expertise in development of any program one can not be called a true "Computer Master". This book covers key topics for those learning about algorithms. Worked examples have been provided through out the book, with exercises at the end of each chapter and a question bank at the end of the book.
Chapter 1: Introduction to Algorithm
Chapter 2: Growth Order
Chapter 3: Elementary Data Structure
Chapter 4: Divide and Conquer Strategy
Chapter 5: Greedy Method
Chapter 6: Dynamic Programming
Chapter 7: NO-Completeness