Page 16 : 36
Object-oriented Programming in C#
Collection Classes
* Collections - History and Overview
A historic View on Collection Programming
* Generic Collections in C#
Overview of Generic Collections in C#
The Interface
IEnumerable<T>
The Interface
ICollection<T>
The Interface
IList<T>
Overview of the class
Collection<T>
Sample use of class
Collection<T>
Specialization of Collections
Specialization of Collections - a realistic example
Overview of the class
List<T>
Sample use of class
List<T>
Sample use of the Find operations in
List<T>
Sample use of Sort in
List<T>
Sample use of BinarySearch in
List<T>
Overview of the class
LinkedList<T>
The class
LinkedListNode<T>
Sample use of class
LinkedList<T>
Time complexity overview: Collection classes
Using Collections through Interfaces
* Generic Dictionaries in C#
Dictionaries
Overview of Generic Dictionaries in C#
The interface
IDictionary<K,V>
Overview of the class
Dictionary<K,V>
Sample use of class
Dictionary<K,V>
Notes about Dictionary Classes
Time complexity overview: Dictionary classes
* Non-generic Collections in C#
The non-generic collection library in C#
Notes about non-generic Collections
* Patterns and Techniques
The Iterator Design Pattern
Making iterators with yield return
Iterator blocks and yield return
Sample use of BinarySearch in
List<T>
An illustration of two overloads of
BinarySearch
Sample uses of List.BinarySearch.
Output from the BinarySearch program.
Searching for a non-existing Point.
Output from the BinarySearch program - non-existing Point.
Lessons learned
Binary search can only be done on sorted lists
In order to use binary search, we need - in general - to provide an explicit
Comparer
object
Binary search returns a (non-negative) integer if the element is found
The index of the located element
Binary search returns a negative integer if the element is not found
The complement of this number is a
ghost index
The index of the element if it had been in the list
