C#教程：2007年《使用C#的数据结构与算法》- 实用指南

需积分: 2 158 浏览量更新于2024-12-28 收藏 5.17MB PDF 举报

"C#算法教程：《数据结构与算法使用C#》（2007年3月）由Mike McMillan编著，专为C#程序员打造，旨在提供实践导向的数据结构和算法学习指南。本书旨在帮助读者摆脱将C++或Java中的数据结构翻译到C#程序中的困扰，直接在.NET Framework库中实现高效的算法和数据结构。第一章介绍了基础，包括集合、泛型和`Timing`类，这是理解整个框架的基础。作者强调通过实际的性能测试而非大O符号来分析算法效率，这种方法更具实用性。第二章详细讲解数组和`ArrayLists`，这是编程中最基本的数据结构，对于内存管理和操作至关重要。第三章深入探讨了基本排序算法，如冒泡排序、插入排序和快速排序，这些都是数据结构课程的核心内容，对数据的高效组织至关重要。第四章涵盖了基本搜索算法，如线性搜索和二分查找，它们在查找特定元素时效率极高。第五章讨论栈和队列，这两个概念在递归函数、数据流处理以及许多计算机科学问题中扮演着核心角色。第六章特别关注`BitArray`类，这是一种二进制位数组，常用于存储和操作大量的二进制数据。除了这些基本概念，书中还涉及了高级主题，如链表、哈希表、字典、树、图等数据结构，以及概率算法和动态规划等更复杂的算法。这些内容对于提升C#开发者的技能和解决实际问题的能力非常有帮助。作者迈克·麦克米伦拥有丰富的教学经验，他在普拉斯基技术学院教授计算机信息系统，同时也在阿肯色大学小石城分校和中央阿肯色大学担任兼职讲师。他的前作《面向对象编程与Visual Basic.NET》和《使用Visual Basic.NET的数据结构与算法》也深受好评。《数据结构与算法使用C#》是一本适合C#专业人员和学生深入学习的权威参考书，它以实用的方法和丰富的示例，为C#开发者提供了实现高效数据结构和算法的全面指南。"

P1: IBE

0521670152c01 CUNY656/McMillan Printer: cupusbw 0 521 67015 2 February 17, 2007 21:2

Collections Described 5

return lname;

}

set {

lname = lastName;

}

public override string ToString() {

return (String.Format("{0}{1}{2}", fname, mname,

lname));

}

public string Initials() {

return (String.Format("{0}{1}{2}",fname.Substring(0,1),

mname.Substring(0,1), lname.Substring(0,1)));

}

public class NameTest {

static void Main() {

Name myName = new Name("Michael", "Mason", "McMillan");

string fullName, inits;

fullName = myName.ToString();

inits = myName.Initials();

Console.WriteLine("My name is {0}.", fullName);

Console.WriteLine("My initials are {0}.", inits);

}

Although many of the elements in the .NET environment are implemented as

classes (such as arrays and strings), several primary elements of the language

are implemented as structures, such as the numeric data types. The Integer

data type, for example, is implemented as the Int32 structure. One of the

methods you can use with Int32 is the Parse method for converting the string

representation of a number into an integer. Here’s an example:

using System;

public class IntStruct {

static void Main() {

P1: IBE

0521670152c01 CUNY656/McMillan Printer: cupusbw 0 521 67015 2 February 17, 2007 21:2

Collections Described 7

Push

David

Raymond

Mike

Bernica

Pop

David

Raymond

Mike

Bernica

FIGURE

1.3. Stack Operations.

Some types of linear lists restrict access to their data elements. Examples

of these types of lists are stacks and queues. A stack is a list where access is

restricted to the beginning (or top) of the list. Items are placed on the list

at the top and can only be removed from the top. For this reason, stacks are

known as Last-in, First-out structures. When we add an item to a stack, we

call the operation a push. When we remove an item from a stack, we call that

operation a pop. These two stack operations are shown in Figure 1.3.

The stack is a very common data structure, especially in computer systems

programming. Stacks are used for arithmetic expression evaluation and for

balancing symbols, among its many applications.

A queue is a list where items are added at the rear of the list and removed

from the front of the list. This type of list is known as a First-in, First-out struc-

ture. Adding an item to a queue is called an EnQueue, and removing an item

from a queue is called a Dequeue. Queue operations are shown in Figure 1.4.

Queues are used in both systems programming, for scheduling operating

system tasks, and for simulation studies. Queues make excellent structures

for simulating waiting lines in every conceivable retail situation. A special

type of queue, called a priority queue, allows the item in a queue with the

highest priority to be removed from the queue ﬁrst. Priority queues can be

used to study the operations of a hospital emergency room, where patients

with heart trouble need to be attended to before a patient with a broken arm,

for example.

The last category of linear collections we’ll examine are called generalized

indexed collections. The ﬁrst of these, called a hash table, stores a set of data

Mike

Raymond

David

Beata

Bernica

Beata

Mike

Raymond

David

Bernica

En Queue

De Queue

FIGURE 1.4. Queue Operations.

P1: IBE

0521670152c01 CUNY656/McMillan Printer: cupusbw 0 521 67015 2 February 17, 2007 21:2

8 INTRODUCTION TO COLLECTIONS, GENERICS, AND TIMING CLASS

“Paul E. Spencer”

“Information Systems”

37500

FIGURE 1.5. A Record To Be Hashed.

values associated with a key. In a hash table, a special function, called a hash

function, takes one data value and transforms the value (called the key) into

an integer index that is used to retrieve the data. The index is then used to

access the data record associated with the key. For example, an employee

record may consist of a person’s name, his or her salary, the number of years

the employee has been with the company, and the department he or she works

in. This structure is shown in Figure 1.5. The key to this data record is the

employee’s name. C# has a class, called HashTable, for storing data in a hash

table. We explore this structure in Chapter 10.

Another generalized indexed collection is the dictionary. A dictionary is

made up of a series of key–value pairs, called associations. This structure

is analogous to a word dictionary, where a word is the key and the word’s

deﬁnition is the value associated with the key. The key is an index into the

value associated with the key. Dictionaries are often called associative arrays

because of this indexing scheme, though the index does not have to be an

integer. We will examine several Dictionary classes that are part of the .NET

Framework in Chapter 11.

Hierarchical Collections

Nonlinear collections are broken down into two major groups: hierarchical

collections and group collections. A hierarchical collection is a group of items

divided into levels. An item at one level can have successor items located at

the next lower level.

One common hierarchical collection is the tree. A tree collection looks like

an upside-down tree, with one data element as the root and the other data

values hanging below the root as leaves. The elements of a tree are called

nodes, and the elements that are below a particular node are called the node’s

children. A sample tree is shown in Figure 1.6.

剩余365页未读，继续阅读

sunnyyd

粉丝: 0
资源: 3

C#教程：2007年《使用C#的数据结构与算法》- 实用指南

CSharp算法Cambridge University Press - Data Structures and Algorithms Using C# (Mar 2007).pdf

CSharp算法Data Structures and Algorithms Using C#

Data Structures and Algorithms Using C Sharp

csharp-streams-and-data：Team Treehouse的C＃流和数据处理模块

Data Structures and Algorithms with Object-Oriented Design Patterns in CSharp - Bruno R. Preiss.chm

data.structures.and.algorithms.using.csharp 2007

data-structures-csharp, 在 C# 中，高级数据结构的库.zip

CSharp中的Algorithms_and_Data-Structures-in_CSharp

CSharp-powershell-to-cs-onitada-sample:从PowerShell调用C＃示例应用程序的代码。对于博客文章

csharp-algorithm-coupon-code：C＃中Perl算法的实现：: CouponCode-https：www.nuget.orgpackagesPowell.CouponCode

最新资源