In C++

Threading the Prime Number Finder

Once your prime number finder is working on a single thread, it is time to do it concurrently using C++ Threads.

You are to simply break up the range of primes into smaller blocks given a number of threads. You should set the range and the number of threads as variables that are easy to change as I will have you make adjustments to them and rerun during the demo. Each thread should display the range it is working on as well as the final value it got over that range.

The threads should then all have their results added up and the final result displayed. Make sure you get the same results as you did in the serial version. Time this version as well.