数据结构与算法(C#语言版)(影印版)(大学计算机教育国外著名教材系列)
点此进入淘宝搜索页搜索分類: 图书,教材教辅与参考书,大学,计算机专业,
品牌: 麦克米兰
基本信息·出版社：清华大学出版社
·页码：337 页
·出版日期：2009年
·ISBN：7302197989/9787302197980
·条形码：9787302197980
·包装版本：1版
·装帧：平装
·开本：16
·正文语种：英语
·丛书名：大学计算机教育国外著名教材系列
产品信息有问题吗？请帮我们更新产品信息。
内容简介《数据结构与算法(C#语言版)(影印版)》是第一本关于在.NET框架下用C#语言实现数据结构与算法的教材。《数据结构与算法(C#语言版)(影印版)》内容丰富，不仅涵盖了涵盖了基本数据结构与算法的知识，而且还介绍了诸如可靠性算法和动态程序设计之类的高等数据结构的内容。《数据结构与算法(C#语言版)(影印版)》的实用性强，介绍了数组与数组列表、链表、哈希表、词典、树、图，以及查找与排序算法，并且还介绍一些高等数据结构算法，如可靠性算法、动态程序设计等。
《数据结构与算法(C#语言版)(影印版)》是C#专业人员和学生学习数据结构与算法的很好用书。
编辑推荐《数据结构与算法(C#语言版)(影印版)》为大学计算机教育国外著名教材系列之一。
目录
Preface page vii
Chapter 1
An Introduction to Collections, Generics, and the
Timing Class 1
Chapter 2
Arrays and ArrayLists 26
Chapter 3
Basic Sorting Algorithms 42
Chapter 4
Basic Searching Algorithms SS
Chapter 5
Stacks and Queues 68
Chapter 6
The BitArray Class 94
Chapter 7
StringS, the String Class, and the StringBuilder Class 119
Chapter 8
Pattern Matching and T6xt Processing 147
Chapter 9
Building Dictionaries: The DictionaryBase Class and the
SortedList Class 165
Chapter 10
Hashing and the Hashtable Class 176
Chapter 11
Link6d Lists 194
Chapter 12
Binary Trees and Binary Search Trees 218
Chapter 13
Sets 237
Chapter 14
Advanced Sorting Algorithms 249
Chapter 15
Advanced Data Structures and Algorithms for Searching 263
Chapter 16
Graphs and Graph Algorithms 283
Chapter 17
Advanced Algorithms 314
Ref6rences 339
……[看更多目录]
序言The study of data structures and algorithms is critical to the developmentof the professional programmer. There are many, many books written ondata structures and algorithms, but these books are usually written as collegetextbooks and are written using the programming languages typically taughtin college——Java or C++. C# is becoming a very popular language and thisbook provides the C# programmer with the opportunity to study fundamentaldata structures and algorithms.
C# exists in a very rich development environment called the .NET Frame-work. Included in the .NET Framework library is a set of data structure classes（also called collection classes）, which range from the Array, ArrayList, andCollection classes to the Stack and Queue classes and to the HashTable andthe SortedList classes. The data structures and algorithms student can now seehow to use a data structure before learning how to implement it. Previously,an instructor had to discuss the concept of, say, a stack, abstractly until thecomplete data structure was constructed. Instructors can now show studentshow to use a stack to perform some computation, such as number base con-versions, demonstrating the utility of the data structure immediately. Withthis background, the student can then go back and learn the fundamentals ofthe data structure （or algorithm） and even build their own implementation.
This book is written primarily as a practical overview of the data struc-tures and algorithms all serious computer programmers need to know andunderstand. Given this, there is no formal analysis of the data structures andalgorithms covered in the book. Hence, there is not a single mathematicalformula and not one mention of Big Oh analysis （if you don't know what thismeans, look at any of the books mentioned in the bibliography）. Instead, thevarious data structures and algorithms are presented as problem-solving tools.
文摘插图：
SUMMARY
This chapter reviews three important techniques we will use often in this book.Many, though not all of the programs we will write, as well as the libraries wewill discuss, are written in an object-oriented manner. The Collection classwe developed illustrates many of the basic OOP concepts seen throughoutthese chapters. Generic programming allows the programmer to simplify thedefinition of several data structures by limiting the number of methods thathave to be written or overloaded. The Timing class provides a simple, yeteffective way to measure the performance of the data structures and algorithmswe will study.
