Open cihati opened 8 years ago
You can see that, in a distributed system, the cost of sorting results grows *exponentially* the deeper we page.
It doesn't grow exponentially -- the growth function is still polynomial (what exactly depends on the number of shards and the sorting algorithm)
Ah, I think this was just a manner of expression, rather than an actual algorithmic complexity time. :)
But yeah, we should be more precise with language. Will fix when I get a chance :)
You can see that, in a distributed system, the cost of sorting results grows *exponentially* the deeper we page.
It doesn't grow exponentially -- the growth function is still polynomial (what exactly depends on the number of shards and the sorting algorithm)