Data Structures
& Algorithms
Complexity analysis, trees, graphs, and common patterns. From basics to advanced.
Time Complexity
Common Complexities
| Complexity | Name | Example |
|---|---|---|
| O(1) | Constant | Array access |
| O(log n) | Logarithmic | Binary search |
| O(n) | Linear | Array traversal |
| O(n log n) | Linearithmic | Merge sort |
| O(n²) | Quadratic | Bubble sort |
| O(2ⁿ) | Exponential | Recursive Fibonacci |
Data Structures
Array
Access: O(1)
Search: O(n)
Insert: O(n)
Delete: O(n)Linked List
Access: O(n)
Search: O(n)
Insert: O(1)
Delete: O(1)Hash Table
Access: O(1) avg
Search: O(1) avg
Insert: O(1) avg
Delete: O(1) avgTrees
Binary Search Tree
Search: O(log n) avg
Insert: O(log n) avg
Delete: O(log n) avgHeap
Find min: O(1)
Insert: O(log n)
Delete min: O(log n)Sorting Algorithms
Comparison Sorts
| Algorithm | Best | Average | Worst |
|---|---|---|---|
| Bubble Sort | O(n) | O(n²) | O(n²) |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) |
| Quick Sort | O(n log n) | O(n log n) | O(n²) |
Download
Print this page or save as PDF for quick reference.
Tip: Use Ctrl+P (Cmd+P on Mac) to print or save as PDF.