nkrth / Sorting-Train

Visualizations of Sorting Algorithms

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Sorting Train

Visualizations of Sorting Algorithms.

First, what are the sorting algorithms?

  • QuickSort
  • Bubble Sort
  • Sorting Through Binary Search
  • Merge Sort
  • Insertion Sort
  • Sort through Breadth-First Search
  • Selection Sort
  • Heapsort
  • Sort through A* search algorithm
  • Radix Sort
  • Sort through Linear Search
  • Shellsort
  • Counting Sort
  • Bogosort
  • Timsort
  • Sort through Iterative deepening depth-first search
  • Gnome Sort
  • Cocktail Shaker Sort
  • Pancake sorting
  • Bitonic sorter
  • Odd-even sort
  • Comb-sort
  • Tree sort
  • Introsort
  • Sorting network
  • Stooge sort
  • Smoothsort
  • Flashsort
  • Pigeonhole sort
  • Bead sort
  • Cycle sort
  • Block sort
  • Tournament sort
  • Spaghetti sort
  • Patience sorting
  • Cubesort
  • Library sort
  • Strandsort
  • Spreadsort
  • Burstsort
  • Unshuffle sort
  • Postman sort
  • Franceschini's sorting
  • Bucket sort (uniform keys)
  • Bucket sort (integer keys)
  • MSD Radix (sort in place)
  • In-place merge sort
  • MSD Radix Sort

References

About

Visualizations of Sorting Algorithms

License:MIT License