added another steepest accent hill climber to experiment runner and
increased all the runs to 10000
h
Made the populationMethods package, Created the Algorithm19 class,
started the algorithm
generated the list of individuals, calculated the best, and now are
working on sorting/taking the m best individuals
Finished the Generation-pass-on calculations (sorted the set and took
mu of the first in the sorted, added to individualArr)
Finished implementation and did refactoring
Ran tests, Feel like there may be some wierdness with our code (will
consult nic) however feel as though it is working soundly.
fixed leaks and numbers of parents and children generated
changed name
Recommitting to git to make a good pull request(?) also removed
some commented-out printlns
testing ExperimentRunner to see if it is the same as the one on the
master brach, and therefore should be removed from the pull request.
committing the CORRECT version of Exprunner from nic's repo
Changed printout to be more descriptive
changed loop to correct variable iterations
Changed the initialization loop to be times.newParents; were getting
an off by 1 error by adding too many using the for(i in 0..numParents)
because numParents is inclusive.

refactored the loop where we add the top elements in
sortedIndividualArr to individualArr by setting individualArr equal to
sortedIndividualArr[0..<numParents]. pretty neat shortcut
Changed the child-making loop so that instead of looking at the size
of the array, it looks at numParents (which is more sensible and
readable than the alternative.
Refactored the sorting, need to split the individualArr and take the
numParent-nth elements
refactored, reduced complexity and standardized some loops
Merge remote branch 'origin/master' into HEAD
Merge branch 'refs/heads/master' of https://github.com/schil227/essentials-of-metaheuristics-groovy.git into HEAD