Sorting Algorithm Visualizer (v4.2)

Array Size: Array Type: Ascending Descending Mountain Valley Many Similar Uniform Random Nearly Sorted Scrambled Tail Scrambled Head Final Merge Real Final Merge Sawtooth Logarithmic Exponential Collatz Sequence Bit Reversed Gray Code Custom Custom Array: Delay (ms): Algorithm: Bubble Sort Reverse Bubble Sort Exchange Sort Circle Sort Odd-Even Sort Cocktail Shaker Sort Comb Sort Quick Sort Quick Sort (Random Pivot) Quick Sort (Center Pivot) Sharp Sort Quick Sort (Dual Pivot) Quick Sort (Median Of Three) Iterative Merge Sort In-Place Merge Sort Iterative In-Place Merge Sort Shell Merge Sort Iterative Shell Merge Sort Bitonic Sort Selection Sort Double Selection Sort Reverse Selection Sort Cycle Sort Min Heap Sort Max Heap Sort Ternary Heap Sort Insertion Sort Gnome Sort Reverse Insertion Sort Shell Sort Counting Sort Flash Sort Pigeonhole Sort Bucket Sort Radix Sort (LSD) Radix Sort (MSD) American Flag Sort Slow Sort Stooge Sort Bogo Sort Stalin Sort Brush Sort Silly Insertion Sort Linear Sort Calcium Sort Parallel Merge Sort Visualization Type: Column Graph Bar Graph Center Pyramid Reverse Columns Pyramid Flat Colors Pixel Mesh Color Circle Color Circle (Sharp) Scatter Plot Spiral Graph Disparity Web Generate Array Shuffle Array Start Sorting Speed Multiplier:

Bubble sort is a simple algorithm that repeatedly compares and swaps adjacent elements in a list until the entire list is sorted. It has a best case, average case, and worst case time complexity of O(n^2).