Algorithims for Professionals

Book Description

This book of Algorithims explains below mentioned topics in detail.
Asymptotic Analysis ; Worst, Average and Best Cases; Asymptotic Notations; Little o and little omega notations; Lower and Upper Bound Theory; Analysis of Loops; Solving Recurrences; Amortized Analysis; What does ‘Space Complexity’ mean?; Pseudo-polynomial Algorithms; NP-Completeness Introduction; Polynomial Time Approximation Scheme; A Time Complexity Question; Time Complexity of building a heap; Time Complexity where loop variable is incremented by 1, 2, 3, 4 ..; Time Complexity of Loop with Powers

Book's Inner Pages

People Also Bought