Algorithms
Master fundamental algorithms through interactive visualizations and detailed explanations. From basic sorting to advanced graph algorithms.
Sorting Algorithms
Bubble Sort
A simple comparison-based sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Selection Sort
A simple sorting algorithm that repeatedly finds the minimum element from the unsorted portion and puts it at the beginning.
Insertion Sort
A simple sorting algorithm that builds the final sorted array one item at a time, inserting each element into its correct position.
Merge Sort
An efficient, stable, comparison-based sorting algorithm that uses divide and conquer approach to sort arrays.
Quick Sort
A highly efficient sorting algorithm that uses divide-and-conquer to sort arrays by selecting a pivot and partitioning around it.
Searching Algorithms
Linear Search
A simple search algorithm that checks every element in a list sequentially until the target element is found or the list ends.
Binary Search
An efficient search algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.