Tracer
Visualizer
About
GitHub
Input Array
Run
Sorting
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Searching
Linear Search
Binary Search
Data Structures
Linked List
Stack
Queue
BST
Select an algorithm and press Run
Pseudocode
Bubble Sort
1
for i from 0 to n-1
2
for j from 0 to n-i-2
3
if arr[j] > arr[j+1]
4
swap arr[j] and arr[j+1]
5
return arr
1
/
0
0.5x
1x