|
![](/i/fill.gif) |
Invisible <voi### [at] dev null> wrote:
> On the other hand, according to my sums 10^80 is roughly 2^266. Thus,
> the binary chop algorithm requires only 266 operations, and can easily
> complete the entire process in well under a second. [If we assume
> completely random access to any atom in the universe, which completely
> defies several known physical laws...]
It would require for the atoms to be sorted in a specific order.
How would you sort them?
--
- Warp
Post a reply to this message
|
![](/i/fill.gif) |