further bugfix

README.md

@@ -44,15 +44,15 @@ First, you need to add the following repository, which is a repository that can
 ```
 
 Than you can add the dependency on our `aitoa-code` repository into your `dependencies` section.
-Here, `0.8.41` is the current version of  `aitoa-code`.
+Here, `0.8.42` is the current version of  `aitoa-code`.
 Notice that you may have more dependencies in your `dependencies` section, say on `junit`, but here I just put the one for `aitoa-code` as example.
 
 ```xml
 <dependencies>
   <dependency>
     <groupId>com.github.thomasWeise</groupId>
     <artifactId>aitoa-code</artifactId>
-    <version>0.8.41</version>
+    <version>0.8.42</version>
   </dependency>
 </dependencies>
 ```

pom.xml

@@ -5,7 +5,7 @@
 
 	<groupId>aitoa</groupId>
 	<artifactId>aitoa-code</artifactId>
-	<version>0.8.41</version>
+	<version>0.8.42</version>
 	<packaging>jar</packaging>
 	<name>aitoa-code</name>
 	<description>Example Source Codes from the Book "Introduction to Optimization Algorithms"</description>

src/main/java/aitoa/algorithms/EA.java

@@ -170,7 +170,8 @@ public final void solve(final IBlackBoxProcess<X, Y> process) {
         }
 
         final Individual<X> dest = P[index];
-        final Individual<X> sel = P[(++p1) % this.mu];
+        p1 = (p1 + 1) % this.mu;
+        final Individual<X> sel = P[p1];
 // end relevant
 // start withcrossover
         if (random.nextDouble() <= this.cr) { // crossover!

src/main/java/aitoa/algorithms/EAWithFitness.java

@@ -158,7 +158,8 @@ public final void solve(final IBlackBoxProcess<X, Y> process) {
         }
 
         final FitnessIndividual<X> dest = P[index];
-        final FitnessIndividual<X> sel = P[(++p1) % this.mu];
+        p1 = (p1 + 1) % this.mu;
+        final FitnessIndividual<X> sel = P[p1];
         if (random.nextDouble() <= this.cr) { // crossover!
           int p2; // to hold index of second selected record
           do { // find a second, different record

src/main/java/aitoa/algorithms/EAWithRestarts.java

@@ -166,8 +166,9 @@ public final void solve(final IBlackBoxProcess<X, Y> process) {
           }
 
           final Individual<X> dest = population[index];
-          final Individual<X> parent1 =
-              population[(++p1) % this.mu]; // parent 1
+          p1 = (p1 + 1) % this.mu;
+          final Individual<X> parent1 = population[p1]; // parent
+                                                        // 1
 
           if (random.nextDouble() <= this.cr) { // crossover!
             int p2;