| 000 | 01224 a2200217 4500 | ||
|---|---|---|---|
| 999 |
_c781 _d781 |
||
| 005 | 20210811130041.0 | ||
| 008 | 190125b ||||| |||| 00| 0 eng d | ||
| 020 | _a9788177583588 | ||
| 040 | _c0 | ||
| 082 |
_a004.422 _bWEI |
||
| 100 | _aMark Allen Weiss | ||
| 245 | _aData structure and algorithm analysis in C | ||
| 250 | _a2nd ed, | ||
| 260 |
_c1997 _bPearson _aNoida |
||
| 300 |
_a527p. _b23cm, |
||
| 505 |
_t1 Introduction _t2 Algorithm Analysis _t3 Lists, Stacks, and Queues _t4 Trees _t5 Hashing _t6 Priority Queues (Heaps) _t7 Sorting _t8 The Disjoint Set ADT _t9 Graph Algorithms _t10 Algorithm Design Techniques _t11 Amortized Analysis _t12 Advanced Data Structures and Implementation |
||
| 520 | _aUsing a C implementation, this book highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. It presents data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees. It offers source code from example programs via anonymous FTP | ||
| 650 | _adata structures | ||
| 942 |
_cBK _2ddc |
||
| 856 |
_uhttp://ndl.iitkgp.ac.in/document/MDl5cHdNUUlnd0lnZHNoQXlvOG5lSWJyUEhEN0FNSzlxTHhwbFlJbWUrUT0 _yNDL access |
||