A place to store my Data Structures & Algorithms notes.
| Done | Type | Best Case | Average Case | Worst Case | Space Complexity |
|---|---|---|---|---|---|
| [x] | Selection Sort | O(n²) | O(n²) | O(n²) | O(1) |
| [x] | Bubble Sort | O(n) | O(n²) | O(n²) | O(1) |
| [x] | Insertion Sort | O(n) | O(n²) | O(n²) | O(1) |
| [ ] | Heap Sort | O(n log n) | O(n log n) | O(n log n) | O(1) |
| [ ] | Quick Sort | O(n log n) | O(n log n) | O(n²) | O(n) |
| [ ] | Merge Sort | O(n log n) | O(n log n) | O(n log n) | O(n) |
| [ ] | Bucket Sort | O(n + k) | O(n + k) | O(n²) | O(n) |
| [ ] | Radix Sort | O(nk) | O(nk) | O(nk) | O(n + k) |
| [ ] | Count Sort | O(n + k) | O(n + k) | O(n + k) | O(k) |
| [ ] | Shell Sort | O(n log n) | O(n log n) | O(n²) | O(1) |
| [ ] | Tim Sort | O(n) | O(n log n) | O(n log n) | O(n) |
| [ ] | Tree Sort | O(n log n) | O(n log n) | O(n²) | O(n) |
| [ ] | Cube Sort | O(n) | O(n log n) | O(n log n) | O(n) |
| [x] | Linear Search | ||||
| [x] | Binary Search | ||||
| [x] | Counting Primitive Operations | ||||
| [x] | Expression Notations | ||||
| [] | Stack code tests | ||||
| [] | Queue code tests | ||||
| [x] | Stack ADT | ||||
| [] | Stack common algorithms' code | ||||
| [x] | Queue ADT | ||||
| [x] | Linked List ADT | ||||
| [x] | Binary Tree | ||||
| [x] | Binary Search Tree | ||||
| [x] | Hash Tables | ||||
| [x] | Priority Queues / Heaps |