| 000 | 01675nam a22006137a 4500 | ||
|---|---|---|---|
| 999 |
_c16773 _d16772 |
||
| 003 | OSt | ||
| 005 | 20231113131813.0 | ||
| 008 | 220811s2011 njua|||| ||| 000 0 eng d | ||
| 020 | _a9780321573513 | ||
| 040 | _cQCPL | ||
| 082 | _a005.1 | ||
| 100 | 1 |
_aSedgewick, Robert _eauthor |
|
| 245 | 1 | 0 |
_aAlgorithms _c/ Robert Sedgewick and Kevin Wayne |
| 250 | _aFourth edition | ||
| 264 | 1 |
_aUpper Saddle River, New Jersey : _bAddison-Wesley, _c[2011] |
|
| 300 |
_axii, 955 pages : _billustrations |
||
| 336 |
_2rdacontent _atext |
||
| 337 |
_2rdamedia _aunmediated |
||
| 338 |
_2rdacarrier _avolume |
||
| 500 | _aIncludes index. | ||
| 505 | 0 | _aFundamentals: | |
| 505 | 0 | _aBasic programming model | |
| 505 | 0 | _aData abstraction | |
| 505 | 0 | _aBags, queues, and stacks | |
| 505 | 0 | _aAnalysis of algorithms | |
| 505 | 0 | _aCase study : union-find | |
| 505 | 0 | _aSorting: | |
| 505 | 0 | _aElementary sorts | |
| 505 | 0 | _aMergesort | |
| 505 | 0 | _aQuicksort | |
| 505 | 0 | _aPriority queues | |
| 505 | 0 | _aApplications | |
| 505 | 0 | _aSearching: | |
| 505 | 0 | _aSymbol tables | |
| 505 | 0 | _aBinary search trees | |
| 505 | 0 | _aHash tables | |
| 505 | 0 | _aApplications | |
| 505 | 0 | _aGraphs: | |
| 505 | 0 | _aUndirected graphs | |
| 505 | 0 | _aDirected graphs | |
| 505 | 0 | _aMinimum spanning trees | |
| 505 | 0 | _aShortest paths | |
| 505 | 0 | _aStrings: | |
| 505 | 0 | _aStrings sorts | |
| 505 | 0 | _aTries | |
| 505 | 0 | _aSubstring search | |
| 505 | 0 | _aRegular expressions | |
| 505 | 0 | _aData compression | |
| 505 | 0 | _aContext | |
| 650 | _aComputer algorithms | ||
| 700 | 1 |
_aWayne, Kevin Daniel _eauthor |
|
| 942 |
_2ddc _cBOOK |
||
| 690 | _aMathematics | ||