Algorithms Toolkit

Big O Calculator turns the abstract notation into real operation counts — enter an input size and see exactly how O(1), O(log n), O(n), O(n log n), and O(n²) compare at that size, as a log-scale chart and an exact-value table side by side. Complexity Visualizer goes further — plots those five classes plus O(2ⁿ) as continuous growth curves on an interactive chart that rescales as you drag the input size up, so you watch the gap between them widen instead of just reading a table. For where those growth rates actually come from, Sorting Algorithm Visualizer runs six real sorting algorithms step by step with real comparison and swap counts — including Quick Sort visibly hitting its O(n²) worst case on a sorted array instead of its usual O(n log n).