Data structure and algorithm analysis in C
Publication details: 1997 Pearson NoidaEdition: 2nd edDescription: 527p. 23cmISBN:- 9788177583588
- 004.422 WEI
Item type | Current library | Call number | Status | Notes | Date due | Barcode |
---|---|---|---|---|---|---|
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Available | 0001562 | ||
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Checked out | 22.08.2024 | 0001563 | |
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Available | 0001564 | ||
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Checked out | 16.09.2024 | 0001565 | |
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Available | 0001566 | ||
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Checked out | CSE | 28.08.2024 | 0000014 |
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Available | CSE | 0000015 | |
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Available | CSE | 0000016 | |
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Checked out | CSE | 21.04.2020 | 0000017 |
![]() |
IIITDM Kurnool General Stacks | 004.422 WEI (Browse shelf(Opens below)) | Checked out | CSE | 28.08.2024 | 0000018 |
Browsing IIITDM Kurnool shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
004.422 WEI Data structure and algorithm analysis in C | 004.422 WEI Data structure and algorithm analysis in C | 004.422 WEI Data structure and algorithm analysis in C | 004.422 WEI Data structure and algorithm analysis in C | 004.422 WEI Data structures and algorithm analysis in C++ | 004.422 WEI Data structures and algorithm analysis in C++ | 004.422 WEI Data structures and algorithm analysis in C++ |
1 Introduction 2 Algorithm Analysis 3 Lists, Stacks, and Queues 4 Trees 5 Hashing 6 Priority Queues (Heaps) 7 Sorting 8 The Disjoint Set ADT 9 Graph Algorithms 10 Algorithm Design Techniques 11 Amortized Analysis 12 Advanced Data Structures and Implementation
Using 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
There are no comments on this title.