VISUALIZATION

Watch algorithms come to life.

Bubble Sort

Repeatedly compares adjacent elements and swaps them if they’re in the wrong order.
Simple but slow — it “bubbles” larger values to the end of the list.

Insertion Sort

Builds the sorted list one element at a time by inserting each new item into its correct position.
Great for small data sets or partially sorted lists.

Selection Sort

Repeatedly selects the smallest remaining element and places it at the beginning.
Easy to understand, but not efficient for large lists.