000 | 01809nam a22003018i 4500 | ||
---|---|---|---|
001 | CR9780511800191 | ||
003 | UkCbUP | ||
005 | 20170526205639.0 | ||
006 | m|||||o||d|||||||| | ||
007 | cr|||||||||||| | ||
008 | 101021s2008||||enk o ||1 0|eng|d | ||
020 | _a9780511800191 (ebook) | ||
020 | _z9780521880374 (hardback) | ||
040 |
_aUkCbUP _beng _erda _cUkCbUP |
||
082 | 0 | 0 |
_a5.1 _222 |
100 | 1 |
_aBrass, Peter, _eauthor. |
|
245 | 1 | 0 |
_aAdvanced Data Structures / _cPeter Brass. |
264 | 1 |
_aCambridge : _bCambridge University Press, _c2008. |
|
300 |
_a1 online resource (474 pages) : _bdigital, PDF file(s). |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
500 | _aTitle from publisher's bibliographic system (viewed on 28 Feb 2017). | ||
520 | _aThis text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text. | ||
650 | 0 | _aComputer algorithms | |
776 | 0 | 8 |
_iPrint version: _z9780521880374 |
856 | 4 | 0 | _uhttps://doi.org/10.1017/CBO9780511800191 |
999 |
_c123973 _d123973 |