3 ms·
In addition to not being sorted it's also not "online." You won't get the first value out of it in constant time if k is too big, and you need to access element
by anonymoushn 11y ago
In addition to not being sorted it's also not "online." You won't get the first value out of it in constant time if k is too big, and you need to access elements in a random order.