| 000 | 00843nam a22003017a 4500 | ||
|---|---|---|---|
| 001 | 36214 | ||
| 003 | Ost | ||
| 005 | 20260507154547.0 | ||
| 008 | 251113s9999||||xx |||||||||||||| ||eng|| | ||
| 020 | _a9789332585485 | ||
| 040 | _cnitttr | ||
| 082 |
_a511.8 _bL579-D |
||
| 100 | _aLevitin Anany | ||
| 245 | 0 | _aIntroduction to The Design and Analysis of Algorithms | |
| 250 | _a3rd ed. | ||
| 260 |
_aNew Delhi, India _bPearson Education India _c2014 |
||
| 300 | _a589 p. | ||
| 650 | _a Decrease and Conquer | ||
| 650 | _a Divide and Conquer | ||
| 650 | _a Dynamic Programming | ||
| 650 | _a Greddy Technique | ||
| 650 | _a Iterative Improvement | ||
| 650 | _a Limitations of Algoritm Power | ||
| 650 | _a Space and Time Trade-Offs | ||
| 650 | _a Transform and Conquer | ||
| 650 | _aBrute Force and Exhaustive Search | ||
| 942 | _cBK | ||
| 999 |
_c112 _d112 |
||