Complexity limitations for randomness

15 Views Asked by At

I’m unsure if this is a stupid question, but:

In general, is guessing a correct value faster when done randomly, or done incrementally from some basic seed/sequence?

For example if I have [1,....,1Billion] and the number I’m guessing at 1B - 1, would it be quicker to jump around randomly or would it be quicker to add 1 incrementally for each guess?

Is there any literature on exactly this question?