Its not.. parallelism in computation has physics, as in cycles spend per object. And you can totally sort something that way reliable. You can even "sieve" large objects out, by creating obstacles of size in that processed array.
It even has a "lightspeed" aka computational object size in cycles * nr of parallel processors. So if you have empty parts of your array, you can insert elements at traveldistance there without violating causality
It even has a "lightspeed" aka computational object size in cycles * nr of parallel processors. So if you have empty parts of your array, you can insert elements at traveldistance there without violating causality