Foundations of algorithms using C++ pseudocode

• Tác giả: Kumarss Naimipour, Richard E Neapolitan
• Ngôn ngữ: eng
• ISBN-10: 0763723878
• Ký hiệu phân loại: 518.1 Algorithms formerly 511.81
• Thông tin xuất bản: Sudbury : Jones and Bartlett, 2004
• Mô tả vật lý: 617 tr. ; , 24 cm
• Bộ sưu tập: Khoa học tự nhiên
• ID: 6734
• Chủ đề: 1. Sử dụng máy tính nâng cao; 2. Thuật toán; 3. Toán cấu trúc

Tóm tắt

- Chapter 1 - Algorithms—Efficiency, Analysis, and Order
- Chapter 2 - Divide-and-Conquer
- Chapter 3 - Dynamic Programming
- Chapter 4 - The Greedy Approach
- Chapter 5 - Backtracking
- Chapter 6 - Branch-and-Bound
- Chapter 7 - Introduction to Computational Complexity—The Sorting Problem
- Chapter 8 - More Computational Complexity—The Searching Problem
- Chapter 9 - Computational Complexity and Interactability—An Introduction to the Theory of NP
- Chapter 10 - Number-Theoretic Algorithms
- Chapter 11 - Introduction to Parallel Algorithms Appendix A - Review of Necessary Mathematics Appendix B - Solving Recurrence Equations—With Applications to Analysis of Recursive Algorithms Appendix C - Data Structures for Disjoint Sets.