

Yeah, this should be equivalent to interpolation search, which has an average performance of O(log(log(n))).
It helps that the months are separately indexed, so instead of a search on 365 input elements, you can do two searches with much lower input size, i.e. 12 and 31.
But yeah, you’re still in the larger O(log(log(n))) category with that.











Well, bullet bras were a thing for quite a while, too: