Welcome to AlgoViz
Get started by choosing anAlgorithm
Selection Sort →
The selection sort algorithm sorts an array by repeatedly finding the minimum element from unsorted part and putting it at the beginning
Bubble Sort →
Bubble Sort works by repeatedly swapping the adjacent elements if they are in the wrong order
Insertion Sort →
Insertion Sort splits the array into a sorted and an unsorted part. Values from the unsorted part are picked and placed at the correct position in the sorted part
Quick Sort →
QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot
Merge Sort →
Merge Sort divides the input array into two halves, calls itself for the two halves, and then it merges the two sorted halves.
BFS →
Breadth-first search used for searching tree or graph It explores all nodes at the present depth prior to moving on to the nodes at the next depth level
DFS →
Depth-first search is an algorithm for traversing or searching tree or graph starts at the root node and explores as far as possible along each branch before backtracking