Binary Spaghetti Sort and The Binary Spaghetti Heads Index

Sorting items is a fundamental problem in computer science and algorithms design. Sorting algorithms can be divided in two categories, comparison based and non-comparison based, depending on the way they perform the sorting. Non-comparison based algorithms work on the nature of numbers, for instance, the fact that they are represented as decimal numbers. In this work, I present a stable non-comparison based sorting algorithm which exploits the binary numbers and bitwise operations to sort items. Due to its nature, this algorithm can be translated into an electrical circuit which can sort N + numbers in parallel.