Algorithms Data Structures and Problem Solving with C++.pdf

【实例简介】
英文第二版 Preface This book is designed for a two-semester sequence in computer science, beginning with what is typically known as Data Structures (CS-2) and con- tinuing with advanced data structures and algorithm analysis. The content of the CS-2 course has been evolving for some time. Although there is some general consensus concerning topic coverage, con- siderable disagreement still exists over the details. One uniformly accepted topic is principles of software development, most notably the concepts of encapsulation and information hiding. Algorithmically, all CS-2 courses tend to include an introduction to running-time analysis, recursion, basic sorting algorithms, and elementary data structures. An advanced course is offered at many universities that covers topics in data structures, algorithms, and running-time analysis at a higher level. The material in this text has been designed for use in both levels of courses, thus eliminating the need to pur- chase a second textbook. Although the most passionate debates in CS-2 revolve around the choice of a programming language, other fundamental choices need to be made, including whether to introduce object-oriented design or object-based design early, the level of mathematical rigor, the appropriate balance between the implementation of data struc- tures and their use, and programming details related to the language chosen. My goal in writing this text was to provide a practical introduction to data structures and algorithms from the viewpoint of abstract thinking and problem solving. I tried to cover all of the important details concerning the data structures, their analyses, and their C++ implementations, while staying away from data structures that are theoretically interesting but not widely used. It is impossible to cover in a single course all the different data struc- tures, including their uses and the analysis, described in thi
【实例截图】
【核心代码】