Keep done_list in order.
Add a simple iterative search function in Report_Done to put the new n value in the right place.
Comment Report_Done().
Add code to break early from the Done_Check search.
Now that the list should be sorted, you don't have to go past where you would go if you were sorted.
Add a maximum to the level for done_level.
If you go higher than five levels, the values of n get to be too high for int values. done_list would also get to be too large.
Add Find_Longest().
Finds the longest contiguous set of completed sets. Used for sending to another node.
Add send to master.
After finding the longest set, it will send that set of sets to the master process to give out.
Give Find_Longest() a minimum value.
We don't want to send only one problems because, by this time, there would be a great amount of communication and not enough actual work. The processors would just be swapping memory back and forth for no gain.
Make an exception for minimum data with master.
Master won't send a set if the start and end are the same.
Add Report_Range_Done().
Adds a range of values to done_list.
Fixed arguments of main().
argv should be a pointer of character arrays, not just a character pointer.
Fix lots of compile-time problems.
Fix bug with master's done_count.
done_count didn't have a start value. Now it starts at 0;
Fix bug where initial problems aren't big enough.
Counted the tasks up to, but not including, the start_level. It is now inclusive.