數(shù)據(jù)結(jié)構(gòu)與算法

前言

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.

內(nèi)容概要

本書是第一本關(guān)于在.NET框架下用C＃語言實現(xiàn)數(shù)據(jù)結(jié)構(gòu)與算法的教材。本書內(nèi)容豐富，不僅涵蓋了基本數(shù)據(jù)結(jié)構(gòu)與算法的知識，而且還介紹了諸如可靠性算法和動態(tài)程序設計之類的高等數(shù)據(jù)結(jié)構(gòu)的內(nèi)容。本書的實用性強，介紹了數(shù)組與數(shù)組列表、鏈表、哈希表、詞典、樹、圖，以及查找與排序算法，并且還介紹一些高等數(shù)據(jù)結(jié)構(gòu)算法，如可靠性算法、動態(tài)程序設計等。    本書是C＃專業(yè)人員和學生學習數(shù)據(jù)結(jié)構(gòu)與算法的很好用書。

作者簡介

作者：(美國) 麥克米蘭 (Mcmillan.M)

書籍目錄

PrefaceChapter 1 An Introduction to Collections，Generics，and the Timing ClassChapter 2 Arrays and ArrayListsChapter 3 Basic Sorting AlgorithmsChapter 4 Basic Searching AlgorithmsChapter 5 Stacks and QueuesChaIpter 6 The BitArray ClassChaIpter 7 Strings,the String Class，and the StringBuilder ClassChaIpter 8 Pattern Matching and Text ProcessingChapter 9 Building Dictionaries：The DictionaryBase CIass and the SortedList ClassChapter 10 Hashing and the Hashtable ClassChapter 11 Linked ListsChapter 12 Binary Trees and Binary Search TreesChapter 13 SetsChapter 14 Advanced Sorting AlgorithmsChapter 15 Advanced Data Structures and Algorithms for SearchingChapter 16 Graphs and Graph AlgorithmsChapter 17 Advanced Algorithms References

章節(jié)摘錄

插圖：SUMMARYThis 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.

編輯推薦

《數(shù)據(jù)結(jié)構(gòu)與算法(C#語言版)(影印版)》為大學計算機教育國外著名教材系列之一。

圖書封面

圖書標簽Tags

無

評論、評分、閱讀與下載

---

    數(shù)據(jù)結(jié)構(gòu)與算法 PDF格式下載

---