Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Caracci, Agustín"'
We study a generalized binary search problem on the line and general trees. On the line (e.g., a sorted array), binary search finds a target node in $O(\log n)$ queries in the worst case, where $n$ is the number of nodes. In situations with limited b
Externí odkaz:
http://arxiv.org/abs/2406.06468
