Computer Algorithms: Correctness Proofs and Performance Analyses


COMPUTER ALGORITHMS
Author: SHASHANK K. MEHTA (Author)
Publisher finelybook 出版社: PHI Learning Pvt. Ltd.
Edition 版次: First Edition
Publication Date 出版日期: 2023-04-25
ISBN-10: 9391818862
ISBN-13: 9789391818869


Book Description
By finelybook

The book is self-contained and includes the desired mathematical background. The book covers most of the data structures and classical graphs algorithms, string algorithms, matroid algorithms, linear algebra algorithms, flow and circulation algorithms, linear programming solvers, and integer algorithms. It covers several topics which are rarely covered in the existing textbooks. Pseudocode is provided for every algorithm. Proof of correctness and the complexity analysis is given for every algorithm. Examples are also provided to help explain several algorithms. The book is designed for an introductory as well as an advance course in the design and analysis of algorithms. It is intended for undergraduate as well as postgraduate students of computer science and engineering.

Table of contents

Part I: Fundamentals of Programming

1. Introduction to Computers, Programming, and C++
2. Elementary Programming
3. Selections
4. Mathematical Functions, Characters, and Strings
5. Loops
6. Functions
7. Single-Dimensional Arrays and C-Strings
8. Multidimensional Arrays

Part II: Object-Oriented Programming

9. Objects and Classes
10. Object-Oriented Thinking
11. Pointers and Dynamic Memory Management
12. Templates, Vectors, and Stacks
13. File Input and Output
14. Operator Overloading
15. Inheritance and Polymorphism
16. Exception Handling

Part III: Data Structures and Advanced Topics

17. Recursion
18. Developing Efficient Algorithms
19. Sorting
20. Linked Lists, Queues, and Priority Queues
21. Binary Search Trees
22. STL Containers
23. STL Algorithms
24. Hashing
25. AVL Trees
26. Graph Applications
27. Weighted Graph Applications

Appendices

Appendix A: C++ Keywords
Appendix B: The ASCII Character Set
Appendix C: Operator Precedence Chart
Appendix D: Number Systems
Appendix E: Bitwise Operations
Appendix F: Using Command-Line Arguments
Appendix G: Enumerated Types
Appendix H: Regular Expressions
Appendix I: The Big-O, Big-Omega, and Big-Theta Notations
Amazon page

相关文件下载地址

下载地址 Download解决验证以访问链接!
打赏
未经允许不得转载:finelybook » Computer Algorithms: Correctness Proofs and Performance Analyses

评论 抢沙发

觉得文章有用就打赏一下

您的打赏,我们将继续给力更多优质内容

支付宝扫一扫

微信扫一扫