in reply to
Re^2: Partition in to 63 parts
in thread Need a faster way to find matches
The data isn't random... the numbers come from another algorithm. Finding the pairs is the middle step of a three step algorithm.
BrowserUK provided a great example of using threads. When I tried your approach, I used too many threads and learned how much overhead threads require. I'll try to merge his partioning approach with my code... I'm finding that after six threads, the performance degrades (on my machine).