An open-source database of algorithms and data structures built for engineers. Analyze time complexities, inspect structures, and run visual trace logs.
def bubbleSort(arr):
n = len(arr)
for i in range(n):
swapped = False
for j in range(0, n-i-1):
if arr[j] > arr[j+1]:
arr[j], arr[j+1] = arr[j+1], arr[j]
swapped = True
if not swapped:
breakWatch sorting algorithms sort datasets in real-time. Adjust speeds, input custom numbers, and compare standard O(n log n) processes.
Trace lookups, divide and conquer splits, and path traversals step-by-step. Visualize binary bounds and depth traversal.
Visualize operations on lists, nodes, and trees. Perform interactive insertion, deletions, and tree re-balancing in memory.
A framework focused on technical precision, control, and code-level inspection.
Adjust array sizing and step-delays on the fly. Pause executions to trace exact computational iterations.
Read simplified code outlines side-by-side with variables. Explore best, worst, and average complexities.
Run visualizers with your own test arrays, negative variables, or character sets. Build custom edge cases.