#algorithms

Showing 3 experiments.

How to Animate Merge Sort Step by Step | QuantumSketch

Animate merge sort by splitting an array into halves until single elements, then merging sorted pairs back up. The recursion tree makes O(n log n) visible.

May 222 min read

#math#animation#algorithms

Visualize Sorting Algorithms Compared | QuantumSketch

Visualize sorting algorithms as bars that swap and settle: bubble sort crawls, quicksort partitions, merge sort divides. Side-by-side animation shows why speed differs.

May 12 min read

#math#animation#algorithms

How to Animate Binary Search | QuantumSketch

Animate binary search by halving a sorted array each step: check the middle, discard the wrong half, repeat. The shrinking window shows the O(log n) speed.

Apr 192 min read