Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
Why do consistent-hashing-based systems use binary search in their lookup algorithm?
A
Node positions on the ring are kept sorted; the owner is the first position ≥ hash(key), found in O(log n)
B
To sort the keys
C
To encrypt keys
D
To compute the hash