Barchart home icon Algorithms visualized • Bubble Sort
  • Radix Sort
    Sorts by grouping elements by shared digit position
  • Insertion Sort
    Builds final sorted array one item at a time
  • Selection Sort
    Sorts by selecting the smallest item from unsorted part of array
  • Bubble Sort
    Repeatedly swaps adjacent elements if they're in the wrong order
  • Merge Sort
    Divides array in half, sorts each half, and merges them back together
  • Heap Sort
    Builds a binary heap from the input data and repeatedly extracts the maximum element
  • Quick Sort
    Divides array into smaller sub-arrays, recursively sorts each sub-array, and combines them
  • Shell Sort
    Variant of insertion sort that sorts groups of elements that are far apart from each other
  • Cocktail Sort
    Bidirectional version of bubble sort that sorts in both directions
  • Bogo Sort
    Randomly shuffles the input data until it is sorted