| 000 | 01331cam a2200205u 4500 | ||
|---|---|---|---|
| 999 |
_c15987 _d15987 |
||
| 020 | _a9780763721299 | ||
| 082 | _a. | ||
| 100 | 1 |
_aNeapolitan, Richard E. _934574 |
|
| 245 | 1 | 0 |
_aFoundations of algorithms using Java pseudocode / _cRichard Neapolitan, Kumarss Naimipour. |
| 260 | 0 |
_aSudbury, Mass. : _bJones and Bartlett, _c2004. |
|
| 300 |
_axv, 618 p. : _bill ; _c24 cm. |
||
| 500 | _aIncludes bibliographical references and index. Ch. 1. Algorithms: Efficiency, Analysis, and Order -- Ch. 2. Divide-and-Conquer -- Ch. 3. Dynamic Programming -- Ch. 4. The Greedy Approach -- Ch. 5. Backtracking -- Ch. 6. Branch-and-Bound -- Ch. 7. Introduction to Computational Complexity: The Sorting Problem -- Ch. 8. More Computational Complexity: The Searching Problem -- Ch. 9. Computational Complexity and Intractability: An Introduction to the Theory of NP -- Ch. 10. Number-Theoretic Algorithms -- Ch. 11. Introduction to Parallel Algorithms -- App. B. Solving Recurrence Equations: With Applications to Analysis of Recursive Algorithms -- App. C. Data Structures for Disjoint Sets. | ||
| 526 | _aCSCI103 | ||
| 526 | 0 | _aCSCI203 | |
| 650 | 4 |
_aAlgorithms. _92438 |
|
| 650 | 4 |
_aComputational complexity. _94193 |
|
| 856 |
_uhttps://uowd.box.com/s/tsxocw67f638sosi2wjho6dr0tt84g3j _zLocation Map |
||