Bead sort (a.k.a Abacus sort, or Gravity sort) is a sorting algorithm that can sort a list of positive integers.
Belonging to a class of natural algorithms, It uses (/simulates) gravity to sort an input list.

The sort algorithm accomplishes this in three acts –


Figure 1: Illustration of abacus sort for an input list [2,6,1,4,3]