X-Git-Url: https://git.dlugolecki.net.pl/?p=genetic.git;a=blobdiff_plain;f=include%2Falgorithm.h;h=cb6acf3cf30a9fbf8227748355e215d4608785d8;hp=9386607347fa9039a999ebf6b9dbd222ce6499f7;hb=917440678dc4e920dfd5810da1274665acb17138;hpb=c7bf950f7db8b2e5843fbead4851d80202570af2

diff --git a/include/algorithm.h b/include/algorithm.h
index 9386607..cb6acf3 100644
--- a/include/algorithm.h
+++ b/include/algorithm.h
@@ -80,8 +80,8 @@ namespace genetic {
         Algorithm(
             generator::Generator<_Chromosome>& _generator,
            _Fitness& _fitness,
-            double crossoverChance,
-            double mutationChance) :
+            float crossoverChance,
+            float mutationChance) :
                 generator(_generator),
                 fitness(_fitness),
                 crossover(crossoverChance),
@@ -135,7 +135,7 @@ namespace genetic {
          * Displays average fitness value of the entire generation.
          */
         void showAvgFitness() {
-            double avg = 0;
+            float avg = 0;
             unsigned int generationSize = this->generation.size();
 
             for (unsigned int i = 0; i < generationSize; i++) {
@@ -150,14 +150,14 @@ namespace genetic {
          * Displays best fitness value of the entire generation.
          */
         void showBestFitness() {
-            double best = -100000;
+            float best = -100000;
             unsigned int generationSize = this->generation.size();
 
             for (unsigned int i = 0; i < generationSize; i++) {
                 _Fitness fit(this->generation[i]);
                 fit.parseArguments(fitness.getArguments());
 
-                double tmp = fit.calculate();
+                float tmp = fit.calculate();
                 if (tmp > best) {
                     best = tmp;
                 }