Introduction - If you have any usage issues, please Google them yourself
Greedy heuristic with the objective of finding the mininal difference between the sums of elementf of two arrays of numbers formed given 80000 random numbers between 100000 and 999999.
It includes what I call the Gym Teacher algorithm that efficiently balances out the two arrays to, along with the greedy, achieve the global optimal in seconds.