C# 4 and .NET 4

266 ❘ ChaPTer 10 cOllectiOns
(continued)
ColleCTion add tnserT remoVe iTem torT find
Dictionary
SortedDictionary
SortedList
O(1) or O(n) na O(1) O(1) na na
O(log n) na O(log n) O(log n) na na
O(n) for
unsorted
data, O(log n)
for end of list,
O(n) if resize
is needed
na O(n) O(log n) to
read/ write,
O(log n) if
the key is in
the list, O(n)
if the key is
not in the list
na
na
summary
This chapter took a look at working with different kinds of collections. Arrays are fixed in size, but you can
use lists for dynamically growing collections. For accessing elements on a first-in, first-out basis, there’s a
queue, and there’s a stack for last-in, first-out operations. Linked lists allow for fast inserting and removing
of elements but are slow for searching. With keys and value, you can use dictionaries, which are fast
for searching and inserting elements. Sets are for unique items and can be ordered (SortedSet) or not
ordered (HashSet). ObservableCollection gives events when items change in the list.
In this chapter, you’ve seen a lot of interfaces and classes and their use for accessing and sorting collections.
You’ve also seen some specialized collections, such as BitArray and BitVector32, which are optimized for
working with a collection of bits.
Chapter 11 gives you details about Language Integrated Query (LINQ).
www.it-ebooks.info