You know, after posting that comment, I really doubted myself, if it really is binary search, because Wikipedia also tells me it needs to be a sorted array.
But yeah, I think that’s only relevant, if your method of checking whether it’s in one half or the other uses > and <. As far as I can tell, so long as you can individually identify the fuses, a.k.a. they’re countable, then you can apply binary search.
domdanial@reddthat.com 2 weeks ago
I don’t think that’s true, it’s more of a set problem. If you pull half the fuses, and the thing is still one, then you’ve ruled out that half. Then you pull half the remaining fuses, and if it turns off it was one of the new half you pulled. Then you put another half back in, ect .
jol@discuss.tchncs.de 2 weeks ago
Ah, I didn’t think of it that way. That indeed would work.