I'm not Scott, but spaghetti sort isn't any kind of computational breakthrough, it's just trading off measurement error for computation time. Here's the digita

I'm not Scott, but spaghetti sort isn't any kind of computational breakthrough, it's just trading off measurement error for computation time. Here's the digital version of spaghetti sort: 1. Enumerate the possible lengths of spaghetti that your spaghetti sorter can distinguish above a certain probability. This enumeration will be small and finite. 2. Round your values to one of these lengths. 3. Radix sort or bucket sort those values in O(n).