000 | 00861 a2200289 4500 | ||
---|---|---|---|
003 | IIITD | ||
005 | 20250214020004.0 | ||
008 | 250211b |||||||| |||| 00| 0 eng d | ||
020 | _a9780999282908 | ||
040 | _aIIITD | ||
082 |
_a005.73 _bROU-A |
||
100 | _aRoughgarden, Tim | ||
245 |
_aAlgorithms illuminated (part 1) : _bthe basics _cby Tim Roughgarden |
||
260 |
_aSan Franscisco : _bSoundlikeyourself Publishing, _c©2017 |
||
300 |
_axii, 206 p. : _bill. ; _c26 cm. |
||
500 | _aIncludes index | ||
505 | _t1. Introduction | ||
505 | _t2. Asymptotic Notation | ||
505 | _t3. Divde-and-conquer algorithms | ||
505 | _t4. The master method | ||
505 | _t5. Quicksort | ||
505 | _t6. Linear-time selection | ||
650 | _aComputer algorithms | ||
650 | _aDynamic Programming | ||
650 | _aGraph algorithms | ||
942 |
_cBK _2ddc _01 |
||
999 |
_c189837 _d189837 |