Algorithm Explorer

Visualize bubble sort step by step - watch adjacent comparisons and swaps animate in real time.

Watch insertion sort build a sorted list one element at a time with smooth animations.

See selection sort find the minimum element and place it in each pass.

Explore merge sort's divide-and-conquer approach - split, sort, and merge arrays visually.

Step through quick sort's partitioning - see how pivots divide and conquer the array.

Watch counting sort tally and place integers without comparisons.

Push, pop, and peek on a stack - see LIFO behavior animate in real time.

Enqueue and dequeue elements - watch FIFO ordering animate step by step.

Insert, delete, and traverse nodes - see pointers link elements one direction.

Navigate forwards and backwards - see both prev and next pointers in action.

Insert, search, and delete nodes in a BST - see the tree rebalance visually.

Watch AVL tree rotations maintain balance after every insertion and deletion.

See red-black tree coloring and rotations keep the tree balanced on every operation.

Insert and search strings in a trie - see how prefixes share paths in the tree.

Watch BFS explore a graph level by level, visiting all neighbors before going deeper.

See DFS dive deep into each branch before backtracking through the graph.

Find shortest paths in weighted graphs - watch distances update as nodes are relaxed.

Identify distinct connected groups in a graph - watch components get colored one by one.

Build a minimum spanning tree - see edges chosen to connect all vertices with least cost.

Order a directed acyclic graph - see nodes arranged so all edges point forward.