My log of times bygone and of those to come
Posts tagged bead-sort
A better implementation of bead-sort
01 year
Introduction
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 –