What are the general differences in C# collections, and what is the underlying data structure?

Question

Just want a brief overview of the differences of c#'s collection types, and what would the underlying data structure be for each?

e.g. string[], ArrayList, Array, List, and hashes, sets, etc.

I know of linked lists, binary trees (in general), but would be interested to know (at a high level) what advantages each has etc.

Duplicate of http://stackoverflow.com/questions/128636/net-data-structures-arraylist-list-hashtable-dictionary-sortedlist-sortedd — Chris Shain, Jun 15 '11 at 21:04
Underneith all collections is array. So for e.g. List has array of int underneith. — activebiz, Jun 16 '11 at 08:34

score 2 · Answer 1 · answered Jun 15 '11 at 21:03

2

MSDN link on collections

answered Jun 15 '11 at 21:03

Xaisoft

45,655
87
279
432

score 0 · Answer 2 · answered Jun 15 '11 at 21:06

0

String[] would just be a straight string array. ArrayList adds the ability to Add() without having a size for the array up front, but loses strong typing. List adds strong typing. A Hash is a key value pair. that si a start.

answered Jun 15 '11 at 21:06

Gregory A Beamer

16,870
3
25
32

What are the general differences in C# collections, and what is the underlying data structure?

2 Answers2