Algorithm Dashboard

Linear Search

Scan elements one by one until the target is found.

Binary Search

Search a sorted array by repeatedly checking the middle.

Bubble Sort

Compare adjacent elements and swap when needed.

Selection Sort

Pick the minimum from unsorted part and place it forward.

Insertion Sort

Insert each element into the correct position of sorted prefix.

Merge Sort

Divide recursively, then merge sorted halves.

Quick Sort

Partition around a pivot and recursively sort partitions.

Heap Sort

Build a max heap and extract the largest element repeatedly.

Radix Sort

Sort integers digit by digit using stable counting passes.

BFS Traversal

Visit graph nodes level by level from a chosen start node.

DFS Traversal

Traverse deeply first using a stack-style exploration order.

Dijkstra

Compute shortest path distances using edge relaxations.

Algorithm Face-Off

Run two sorting/searching algorithms side by side on the same input.