JOIN
Get Time
forums   
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Is there an easier way than binary search if I don't want to find the index? | Reply
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!
Subject Author Date
Is there an easier way than binary search if I don't want to find the index? ctian Jan 19, 2006 at 8:27 PM EST
Re: Is there an easier way than binary search if I don't want to find the index? Kawigi Jan 19, 2006 at 8:31 PM EST
Re: Is there an easier way than binary search if I don't want to find the index? dskloet Jan 20, 2006 at 3:45 AM EST
Re: Is there an easier way than binary search if I don't want to find the index? ctian Jan 20, 2006 at 2:22 PM EST
Re: Is there an easier way than binary search if I don't want to find the index? hennerywatson Jul 26, 2017 at 7:23 AM EDT
Re: Is there an easier way than binary search if I don't want to find the index? charlesainsley Nov 6, 2017 at 3:01 AM EST
RSS