Foundations of Algorithms Using Java PseudocodeJones & Bartlett Learning, 2004 - 618 páginas Neapolitan and Naimipour (both: computer science, Northeastern Illinois University) present material on designing algorithms, complexity analysis of algorithms, and computational complexity in this text for mainstream computer science students with background in college algebra and discrete structur |
Conteúdo
Efficiency Analysis and Order | 1 |
CHAPTER | 11 |
DivideandConquer | 47 |
Dynamic Programming | 91 |
The Greedy Approach | 137 |
Backtracking | 187 |
BranchandBound | 233 |
The Sorting Problem | 267 |
An Introduction to | 375 |
NumberTheoretic Algorithms | 419 |
APPENDIX | 511 |
APPENDIX | 549 |
B 3 | 559 |
APPENDIX C | 590 |
REFERENCES | 599 |
| 605 | |
Outras edições - Ver todos
Termos e frases comuns
0-1 Knapsack problem algorithm Algorithm Analysis of Algorithm backtracking algorithm basic operation binary search tree branch-and-bound comparisons of keys Compute Decision problem decision tree determine digits discussed divide-and-conquer dynamic programming edge efficient equal example Exchange Sort Exercise Figure function given graph greedy algorithm Heapsort Implement induction input Insertion Sort Interpolation Search keytype largest key Lemma loop lower bound matrix maxprofit means Mergesort minimum spanning tree multiplication n-Queens problem node containing nondecreasing order nonpromising NP-complete number of comparisons number of nodes obtained optimal solution optimal tour pivotitem pivotpoint polynomial polynomial-time algorithm positive integer Prim's algorithm probability processor profit promising proof pruned public static void Quicksort recursive call root Section sequence shortest path solve sorting algorithms space tree subarray subset subtree Suppose Theorem total number total weight Traveling Salesperson problem v₁ vertex vertices Visit node worst-case time complexity