Usually that is done before run time and hard coded into the hash function. But for numbers in the range you are talking about, a sieve would work. However trial division should not take long either, if you just need to do it once when the hash table is created. Don
On Aug 25, 10:18 pm, Navneet Gupta <navneetn...@gmail.com> wrote: > Needless to say. looking for an efficient solution rather than trying > successive numbers from given number for primality. Any method? > > A general purpose use of above is to calculate N for hash functions. (index > = key%N where N is prime). > > -- > Regards, > Navneet -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
