Lecture overview -- Keyboard shortcut: 'u'  Previous page: Notes about Dictionary Classes -- Keyboard shortcut: 'p'  Next page: Non-generic Collections in C# [Section] -- Keyboard shortcut: 'n'  Lecture notes - all slides together  Annotated slide -- Keyboard shortcut: 't'  Textbook -- Keyboard shortcut: 'v'  Alphabetic index  Help page about these notes  Course home    Collection Classes - slide 29 : 36

Time complexity overview: Dictionary classes
Assume that we work on a dictionary with n elements
Operation Dictionary<K,V> SortedDictionary<K,V> SortedList<K,V>
this[key] O(1) O(log n) O(log n) or O(n)
Add(key,value) O(1) or O(n) O(log n) O(n)
Remove(key) O(1) O(log n) O(n)
ContainsKey(key) O(1) O(log n) O(log n)
ContainsValue(value) O(n) O(n) O(n)