2 ms·
In this case, Sublinear Algorithms refers to algorithms that don't consider the entire input set. A B-Tree would not qualify because it must first consider the
by Aurornis 2y ago
In this case, Sublinear Algorithms refers to algorithms that don't consider the entire input set.
A B-Tree would not qualify because it must first consider the entire input set. Only later operations can be less than O(n) because you've already done O(n) or greater work on the data set.