bead–sort :: a natural sorting algorithm
TRANSCRIPT
![Page 1: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/1.jpg)
Bead–Sort: A Natural Sorting Algorithm
Joshua J. Arulanandham, Cristian S. Calude, Michael J. Dinneen
In The Bulletin of the European Association for Theoretical Computer Science 76 (2002)
![Page 2: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/2.jpg)
Abstract
Nature is not only a source of minerals and precious stones
but is also a mine of algorithms. By observing and studying
natural phenomena, computer algorithms can be extracted.
In this note, a simple natural phenomenon is used to
design a sorting algorithm for positive integers, called here
Bead–Sort. The algorithm’s run–time complexity ranges
from O(1) to O(S) (S is the sum of the input integers)
depending on the user’s perspective. Finally, three possible
implementations are suggested.
![Page 3: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/3.jpg)
![Page 4: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/4.jpg)
Time Complexity
Time complexity of Bead–Sort can be evaluated at three different levels:
● ‘dropping all beads together’ as a single operation
O(1)
● ‘dropping the row of beads’ in the frame (representing
a number) O(n)
● ‘dropping each and every bead’ as a separate
operation. O(S) where S is the sum of the input
integers.Space n-square
Only for positive integers
![Page 5: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/5.jpg)
Implementation (Analog Hardware Implementation)
![Page 6: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/6.jpg)
Implementation (Cellular Automaton Implementation)
![Page 7: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/7.jpg)
Implementation (Digital Hardware Implementation)
![Page 8: Bead–Sort :: A Natural Sorting Algorithm](https://reader035.vdocuments.mx/reader035/viewer/2022081821/55a4dd091a28ab48768b4572/html5/thumbnails/8.jpg)
QUESTIONS