Data Visualizer
A display of different algorithms used in the world of computer science. Ranges from array sorting algorithms to maze traversal algorithms.
Select one of the buttons on the side to pick between sorting and traversal.
/sort
Algorithm:
Array Size:
Delay (ms) :
Bubble Sort:
Bubble Sort is an elementary sorting algorithm that work
by repeatedly stepping through the list, comparing each
pair of adjacent elements, and swapping them if they are
in the wrong order. The algorithm gets its name from the
way smaller elements "bubble" to the top of the list
as the larger elements "sink" to the bottom . The process
is repeated until the entire list is sorted.
Time Complexity:
Best Case: \(\Omega(n)\)
Average Case: \(\Theta(n^2)\)
Worst Case: \(\mathcal{O}(n^2)\)
Space Complexity:
Worst Case: \(\mathcal{O}(1)\)
/traverse
Algorithm: