|
|
|
|
| LEADER |
01730nam a2200253Ia 4500 |
| 008 |
150624b xxu||||| |||| 00| 0 eng d |
| 020 |
|
|
|a 0669352985
|
| 082 |
|
|
|a 511.8
|
| 100 |
|
|
|a Neapolitan, Richard E.
|
| 245 |
|
|
|a Foundations of algorithms /
|c Richard E. Neapolitan
|
| 250 |
|
|
|a 4th Ed.
|
| 260 |
|
|
|b Janes & Bartlet
|c 2011
|
| 300 |
|
|
|a 627 p.
|
| 505 |
|
|
|a 1. Algorithms:efficiency, analysis, and order 2. Divide-and-conquer 3. Dynamic programming 4. Greedy approach 5.Backtracking 6. Brach-and-bound 7. Introduction to computational complexity: sorting problem 8. More computational complexity:searching problem
|
| 700 |
|
|
|a Naimipour, Kumarss
|
| 942 |
|
|
|c BK
|
| 999 |
|
|
|c 47268
|d 47268
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 511_800000000000000_NEA_F
|7 0
|9 47249
|a UL
|b UL
|c ST2
|d 1998-09-01
|l 0
|o 511.8 NEA/F
|p 69261
|r 2012-10-27
|w 2012-10-27
|y BK
|k USD 53.00
|
| 952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 511_800000000000000_NEA_F
|7 0
|9 409284
|a DCS
|b DCS
|c ST1
|d 2020-11-10
|i 240
|l 0
|o 511.8 NEA/F
|p DCS240
|r 2020-11-10
|w 2020-11-10
|y BK
|
| 952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 511_800000000000000_NEA_F
|7 0
|9 409285
|a DCS
|b DCS
|c ST1
|d 2020-11-10
|i 241
|l 0
|o 511.8 NEA/F
|p DCS241
|r 2020-11-10
|w 2020-11-10
|y BK
|
| 952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 511_800000000000000_NEA_F
|7 0
|9 409286
|a DCS
|b DCS
|c ST1
|d 2020-11-10
|i 242
|l 0
|o 511.8 NEA/F
|p DCS242
|r 2020-11-10
|w 2020-11-10
|y BK
|
| 952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 511_800000000000000_NEA_F
|7 0
|9 409287
|a DCS
|b DCS
|c ST1
|d 2020-11-10
|i 243
|l 0
|o 511.8 NEA/F
|p DCS243
|r 2020-11-10
|w 2020-11-10
|y BK
|
| 952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 511_800000000000000_NEA_F
|7 0
|9 409288
|a DCS
|b DCS
|c ST1
|d 2020-11-10
|i 244
|l 0
|o 511.8 NEA/F
|p DCS244
|r 2020-11-10
|w 2020-11-10
|y BK
|
| 952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 511_800000000000000_NEA_F
|7 0
|9 409289
|a DCS
|b DCS
|c ST1
|d 2020-11-10
|i 245
|l 0
|o 511.8 NEA/F
|p DCS245
|r 2020-11-10
|w 2020-11-10
|y BK
|