diff options
| author | Eduardo Pedroni <ep625@york.ac.uk> | 2014-05-15 09:16:20 +0100 |
|---|---|---|
| committer | Eduardo Pedroni <ep625@york.ac.uk> | 2014-05-15 09:16:20 +0100 |
| commit | 2a655a0b1654a2721089f0f8d99b846d7e198f38 (patch) | |
| tree | 031f898cbedd39e88d658f46feecb50a38585f67 /src/jcgp/backend/modules | |
| parent | c35a6806df01481c1b169cd0fc47660ea1cc10fb (diff) | |
Cleaned up a few comments
Diffstat (limited to 'src/jcgp/backend/modules')
| -rw-r--r-- | src/jcgp/backend/modules/es/MuPlusLambda.java | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/jcgp/backend/modules/es/MuPlusLambda.java b/src/jcgp/backend/modules/es/MuPlusLambda.java index 6a6870f..c2981cb 100644 --- a/src/jcgp/backend/modules/es/MuPlusLambda.java +++ b/src/jcgp/backend/modules/es/MuPlusLambda.java @@ -117,7 +117,7 @@ public class MuPlusLambda extends EvolutionaryStrategy { private void sort(Population population) { /* Create an array with the index of each of the current parents. * This is done to speed up the sort. No deep chromosome copies are - * made until the algorithm is finished; instead, only indices are copied. + * made until the sort is finished; instead, only indices are copied. */ int[] parents = new int[mu.get()]; for (int i = 0; i < parents.length; i++) { |