| 000 | 01509nam a2200337 a 4500 | ||
|---|---|---|---|
| 001 | 2049672 | ||
| 003 | BD-DhDIU | ||
| 005 | 20250518141643.0 | ||
| 008 | 961107s1997 nyua b 001 0 eng | ||
| 010 | _a 96049610 | ||
| 020 | _a0716783150 | ||
| 035 | _a(OCoLC)35928547 | ||
| 035 | _a(OCoLC)ocm35928547 | ||
| 035 | _a(NNC)2049672 | ||
| 040 |
_aDLC _cDLC _dDLC _dOrLoB-B _dBD-DhDIU _bENG |
||
| 050 | 0 | 0 |
_aQA76.73.C153 _bH666 1997 |
| 082 | 0 | 0 |
_a005.13/3 _222 |
| 100 | 1 |
_aHorowitz, Ellis. _91267 |
|
| 245 | 1 | 0 |
_aComputer algorithms/C++ _cEllis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran. |
| 246 | 3 | _aComputer algorithms/C plus plus | |
| 260 |
_aNew Delhi : _bGalgotia Publications, _cc1997. |
||
| 300 |
_axxii, 769 p. : _bill., figs., tables ; _c22 cm. |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | 0 | 0 |
_g1. _tIntroduction -- _g2. _tElementary Data Structures -- _g3. _tDivide-and-Conquer -- _g4. _tThe Greedy Method -- _g5. _tDynamic Programming -- _g6. _tBasic Traversal and Search Techniques -- _g7. _tBacktracking -- _g8. _tBranch-And-Bound -- _g9. _tAlgebraic Problems -- _g10. _tLower Bound Theory -- _g11. _tNP-Hard and NP-Complete Problems -- _g12. _tApproximation Algorithms -- _g13. _tPRAM Algorithms -- _g14. _tMesh Algorithms -- _g15. _tHypercube Algorithms. |
| 650 | 0 |
_aC++ (Computer program language) _91221 |
|
| 650 | 0 |
_aComputer algorithms. _91268 |
|
| 700 | 1 |
_aSahni, Sartaj. _91272 |
|
| 700 | 1 |
_aRajasekaran, Sanguthevar. _91273 |
|
| 900 | _bTOC | ||
| 942 |
_2ddc _cBK _019 |
||
| 999 |
_c1681 _d1681 |
||