
I just want to verify that a given input can be found in a constant set, and don't need to find out where in the set it is. Is there a better way than binary search? I tried minimal perfect hashing function, but it is still not the best in terms of memory space and computational time. In fact, I do not need the function to be minimal perfect, since collision is OK. Thank you! 