3 ms·
Yes, because I use more of a Monte Carlo approach than a systematic approach. zegup.com is always alphabetic, but since the results are so slow it could take a
by shocks 15y ago
Yes, because I use more of a Monte Carlo approach than a systematic approach. zegup.com is always alphabetic, but since the results are so slow it could take a long time to get to the end of the alphabet.
- RuggeroAltair 15y ago+1 for randomizing. do you produce the string with the monte carlo choosing within a specific subset? I'm not sure why it wouldn't produce more than 5 combinations and then 5 different combinations... also, if you have-time/like, you can probably implement a quick hash on the fly for the domains already returned to avoid listing the same domain twice in a search with few alternatives, it should be quick. but cool tool!
- shocks 15y agoHash is a great idea. Thanks! I'll implement the hash now. I build an array of arrays where each subset array has all the possibilities for that letter. So if the query was N then a[0] = [0,..,9]. Then I just pick a random element from each subset array and stitch them all together in order.