000			01318nam a22002057a 4500
003			OSt
005			20250513135740.0
008			250513b |||||||| |||| 00| 0 eng d
020			_a9789354977886
040			_bEng _cNLU
082			_223rd Ed. _a005.1 _bSRI
100			_aSridhar, S.
245			_aDesign and Analysis of Algorithms/ _cBy S. Sridhar.
250			_a2nd Ed.
260			_a New Delhi: _bOxford University Press, _c2024.
300			_axiv, 680p;, _c24cm.
500			_aContents: 1. Introduction to Algorithms. 2. Basics of Algorithms Writing. 3. Basics of Algorithms Analysis. 4. Mathematical Analysis of Recursive Algorithms. 5. Data Structures - I 6. Data Structures - II 7. Brute Force Approaches. 8. Divide and Conquer Approach. 9. Decrease and Conquer Approach. 10. Time Space Tradeoffs. 11. Greedy Algorithms. 12. Transform and Conquer Approach. 13. Dynamic Programming. 14. Backtracking. 15. Branch and Bound Technique. 16. String Algorithms. 17. Iterative Improvement and Linear Programming. 18. Basics of Computational Complexity. 19. Randomized Algorithms. 20. Approximation Algorithms. 21. Parallel Algorithms.
504			_aIncludes: 1. Appendix A 2. Appendix B 3. Appendix C 4. Appendix D 5. Appendix E 6. Bibliography. 7. Index.
942			_2ddc _cBK _e2nd Ed. _n0
999			_c14062 _d14062