µ±Ç°Î»ÖãºÊ×Ò³ » ·þÎñÆ÷¼¼Êõ

¿ª·¢¼¼ÊõÖ¸ÄÏ» ÎÄÕÂÕýÎÄ

    ÒýÑÔ£º An Extensive Examination of Data

 

 

Data Structures with .NET - Part 1: An Introduction to Data Structures
an extensive examination of data structures

scott mitchell ¡¾Ïà¹ØÎÄÕÂ:ÎÞģʽ¶Ô»°¿òµÄһЩעÒâÊÂÏî¡¿

part 1: an introduction to data structures ¡¾À©Õ¹ÔĶÁ:Internet Explorer ±à³Ì¡¿

4guysfromrolla.com ¡¾À©Õ¹ÐÅÏ¢:2003ϵͳʶ±ðÍâÀ´É豸һÀý£¨Ô­´´£©¡¿

october 2003

summary: this article kicks off a six-part series that focuses on important data structures and their use in application development. we´ll examine both built-in data structures present in the .net framework, as well as essential data structures we´ll have to build ourselves. this first installment focuses on defining what data structures are, how the efficiency of data structures is analyzed, and why this analysis is important. in this article, we´ll also examine the array and arraylist, two of the most commonly used data structures present in the .net framework. (12 printed pages)

contents

introduction

analyzing the performance of data structures

everyone´s favorite linear, direct access, homogeneous data structure

the arraylist: a heterogeneous, self-redimensioning array

conclusion

introduction

welcome to the first in a six-part series on using data structures in .net. throughout this article series we will be examining a variety of data structures, some of which are included in the .net framework base class library and others that we´ll build ourselves. if you´re unfamiliar with the term, data structures are abstract structures, or classes, that are used to organize data and provide various operations upon their data. the most common and likely well-known data structure is the array, which contains a contiguous collection of data items that can be accessed by an ordinal index.

before jumping into the content for this article, let´s first take a quick peek at the roadmap for this six-part article series, so that you can see what lies ahead. if there are any topics you think are missing from this outline, i invite you to e-mail me at mitchell@4guysfromrolla.com and share your thoughts. space permitting, i´ll be happy to add your suggestions to the appropriate installment or, if needed, add a seventh part to the series.

in this first part of the six-part series, we´ll look at why data structures are important, and their effect on the performance of an algorithm. to determine a data structure´s effect on performance, we´ll need to examine how the various operations performed by a data structure can be rigorously analyzed. finally, we´ll turn our attention to two data structures present in the .net framework—the array and arraylist. chances are you´ve used both of these data structures in past projects. in this article, we´ll examine what operations they provide and the efficiency of these operations.

in part 2, we´ll explore the arraylist class in more detail and examine its counterparts, the queue class and stack class. like the arraylist, both the queue and stack classes store a contiguous collection of data and are data structures available in the .net framework base class library. however, unlike an arraylist from which you can retrieve any data item, queues and stacks only allow data to be accessed in a predetermined sequential order. we´ll examine some applications of queues and stacks, and see how to implement both of these classes by extending the arraylist class. after examining queues and stacks, we´ll look at hashtables, which allow for direct access like an arraylist, but store data indexed by a string key.

...   ÏÂÒ»Ò³

» ±¾ÆÚÈÈÃÅÎÄÕ£º

· ÈÈÃÅÀ¸Ä¿£º

» Ïà¹Ø¾«Ñ¡ÎÄÕÂ

» ÆäËüÏà¹Ø£º