تحلیل ساختارهای داده و الگوریتم‌ها در C++

In this adaptation of his successful book, Data Structures and Algorithm Analysis, Mark Allen Weiss provides an innovative approach to algorithms and data structures in C++. He highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C++ with his clear, friendly writing style, logical organization of topics, and extensive use of figures and examples that show the successive stages of an algorithm. Data.Structures.and.Algorithm.Analysis.in.C.pdf 1 Preface.pdf 2 CHAPTER 1 INTRODUCTION.pdf 6 CHAPTER 2 ALGORITHM ANALYSIS.pdf 20 CHAPTER 3 LISTS, STACKS, AND QUEUES.pdf 50 CHAPTER 4 TREES.pdf 97 CHAPTER 5 HASHING.pdf 162 CHAPTER 6 PRIORITY QUEUES (HEAPS).pdf 192 CHAPTER 7 SORTING.pdf 238 CHAPTER 8 THE DISJOINT SET ADT.pdf 287 CHAPTER 9 GRAPH ALGORITHMS.pdf 310 CHAPTER 10 ALGORITHM DESIGN TECHNIQUES.pdf 385 CHAPTER 11 AMORTIZED ANALYSIS.pdf 468 The second edition refines and enhances the approach to algorithms and datastructures. Highlights theoretical topics like abstract data types and the efficiency of algorithms as well as performance and running time. Includes a new chapter on advanced data structures and material on the Standard Template Library conforming to the new standard.