| 컬렉션 | 제네릭 컬렉션 | 내부 구현 | 삽입 | 탐색 | 제거 |
|---|---|---|---|---|---|
| ArrayList | List<> | Array | O(1) | O(n) | O(n) |
| SortedList | SortedList<,> | Array | O(log n) | O(log n) | O(n) |
| Stack | Stack<> | Array | O(1) | - | O(1) |
| Queue | Queue<> | Array | O(1) | - | O(1) |
| HashTable | Dictionary<,> | Array(hashing)/HashTable | O(1) | O(1) | O(1) |
| HashSet<> | HashTable | O(1) | O(1) | O(1) | |
| LinkedList<> | LinkedList | O(1) | O(n) | O(n) | |
| SortedSet<> | Red-Black Tree | O(log n) | O(log n) | O(log n) | |
| SortedDictionary<,> | Red-Black Tree | O(log n) | O(log n) | O(log n) | |
| PriorityQueue<> | Min-Heap | O(1)/O(log n) | O(1)/O(log n) | O(log n) |
Runner's high를 목표로