New answers tagged

1 vote

Alternative to binary search trees: A sorted array with empty spaces

There are two ways to analyze this: worst-case and average-case. In the worst case, an adversary can always direct an incoming element to the shortest gap or longest gap-free region. After an ...
user avatar

Top 50 recent answers are included