|
|
|
|
Leader |
LDR
|
|
cam a 00 |
Control # |
1
|
|
hbl99050894 |
Control # Id |
3
|
|
GCG |
Date |
5
|
|
20211021125009.0 |
Fixed Data |
8
|
|
110708s2010 nyua 001 0 eng d |
LC Card |
10
|
|
$a 2011287235 |
ISBN |
20
|
|
$a9781430232377 |
ISBN |
20
|
|
$a1430232374 |
Local Ctrl # |
35
|
|
$a(OCoLC)ocn630509630 |
Obsolete |
39
|
|
$a272133$cTLC |
Cat. Source |
40
|
|
$aBTCTA$beng$cBTCTA$dJBL$dYDXCP$dCDX$dNUI$dCNCEN$dDLC$dGCG |
Authen. Ctr. |
42
|
|
$alccopycat |
LC Call |
50
|
00 |
$aQA76.73.P98$bH485 2010 |
Dewey Class |
82
|
04 |
$a005.133$222 |
ME:Pers Name |
100
|
1 |
$aHetland, Magnus Lie. |
Title |
245
|
10 |
$aPython Algorithms :$bmastering basic algorithms in the python language /$cMagnus Lei Hetland. |
Imprint |
260
|
|
$aNew York, N.Y. :$bApress,$cc2010. |
Phys Descrpt |
300
|
|
$axvi, 316 p. :$bill. ;$c24 cm. |
Series:Diff |
490
|
1 |
$aExpert's voice in open source |
Note:General |
500
|
|
$aIncludes index. |
Note:Content |
505
|
0 |
$aThe basics -- Counting 101 -- Induction and recursion ... and reduction -- Traversal: the skeleton key of algorithmics -- Divide, combine, and conquer -- Greed is good? Prove it! -- Tangled dependencies and memorization -- From A to B with Edsger and friends -- Matching, cuts, and flows -- Hard problems and limited sloppiness. |
Local Note |
590
|
|
$aRecommended in Resources for College Libraries |
Subj:Topical |
650
|
0 |
$aPython (Computer program language) |
Subj:Topical |
650
|
0 |
$aComputer algorithms. |
SE:Ufm Title |
830
|
0 |
$aExpert's voice in open source. |