Analyze and calculate algorithmic complexity, time complexity, and space complexity
Calculate and visualize Big O notation, time complexity, and space complexity for different algorithms and data structures.
| Algorithm | Best Case | Average Case | Worst Case | Space |
|---|---|---|---|---|
| Quick Sort | O(n log n) | O(n log n) | O(n²) | O(log n) |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) | O(n) |
| Binary Search | O(1) | O(log n) | O(log n) | O(1) |
| Hash Table | O(1) | O(1) | O(n) | O(n) |
Consider these factors when analyzing complexity: