Explore
101 visualisers you can step through forwards and backwards, with synced code and a reason for every move.
Showing 14 of 101
Pastel = track · chip = your mastery
- SortingBubble SortA simple sorting algorithm that repeatedly steps through the list.O(n²)
- SortingSelection SortA sorting algorithm that divides the input into sorted and unsorted regions.O(n²)
- SortingInsertion SortA sorting algorithm that builds the final sorted array one item at a time.O(n²)
- SortingMerge SortA divide-and-conquer algorithm that recursively breaks down the problem.O(n log n)
- SortingQuick SortA divide-and-conquer algorithm that picks an element as a pivot.O(n log n)
- SortingHeap SortA comparison-based sorting algorithm that uses a binary heap.O(n log n)
- SortingCounting SortA sorting algorithm that counts the occurrences of each element.O(n + k)
- SortingRadix SortA non-comparative sorting algorithm that sorts data with integer keys.O(d·(n + b))
- SearchingLinear SearchA simple search algorithm that checks each element in sequence.O(n)
- SearchingBinary SearchA search algorithm that finds the position of a target value in a sorted array.O(log n)
- SearchingJump SearchA search algorithm for sorted arrays that jumps ahead by fixed steps.O(√n)
- SearchingInterpolation SearchA search for sorted arrays that estimates where the target should be from its value.O(log log n)
- SearchingExponential SearchA search algorithm that finds the range where element is present.O(log n)
- SearchingFibonacci SearchA search algorithm that uses Fibonacci numbers to search in sorted arrays.O(log n)