Algorithm Library
Interactive visualizations for computer science algorithms. Analyze time complexity, space complexity, and step-by-step logic.
Arrays
Linked Lists
Sorting Algorithms
Bubble Sort
Repeatedly steps through the list, swaps adjacent elements if they are in the wrong order.
Insertion Sort
Builds the final sorted array one item at a time, efficient for small data sets.
Selection Sort
Divides the input list into two parts: sorted and unsorted, picking the minimum.
Merge Sort
Divide and conquer algorithm that splits the array and merges sorted subarrays.
Quick Sort
Picks a pivot element and partitions the array around the pivot.
Search Algorithms
Linear Search
Sequentially checks each element of the list until a match is found.
Binary Search
Search a sorted array by repeatedly dividing the search interval in half.
Search in Rotated
Finds an element in a sorted array that has been rotated at some pivot.
Ternary Search
Determines the maximum or minimum of a unimodal function/array.