Algorithm Visualizer

Settings

Dark Mode

Text Size

Welcome

Welcome to Algorithm Visualizer.

This webapp will help you understand what common algorithms are doing visually.

There are three different types of algorithms and even more algorithms that are specific to that type.

To get started, just click "Go" on an algorithm type and select a specific algorithm.

Sorting Algorithms

A sorting algorithm is an algorithm that puts elements of a list into an order.

Searching Algorithms

Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored.

Pathfinding Algorithms

Pathfinding is the plotting of the shortest route between two points.

Sorting Algorithms

A sorting algorithm is an algorithm that puts elements of a list into an order.

Insertion Sort

Insertion sort is a sorting algorithm that places an unsorted element at its suitable place in each iteration.

Selection Sort

The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning.

Bubble Sort

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.

Quick Sort

QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot.

Searching Algorithms

Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored.

Linear Search

Linear Search is a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found.

Binary Search

Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half.

Pathfinding Algorithms

Pathfinding is the plotting of the shortest route between two points.

A* Pathfinding

A* is more efficient than Djikstra's and guarantees the shortest path between two points.

Djikstra's Algorithm

Djikstra's is unweighted and finds the shortest path between one point and the rest of the map.

Jump Point Search

Jump Point Search is an extension of A*. It eliminates symmetrical paths and jumps over redundant nodes. Only works on uniform-cost grids.