Merge branch 'master' of https://github.com/Samar-Upreti/Python

Author: Samar-Upreti

genetic_algorithm/basic_string.py

@@ -54,9 +54,9 @@ def mutate(child: str, genes: list[str]) -> str:
     """
     child_list = list(child)
     if random.uniform(0, 1) < MUTATION_PROBABILITY:
-        random_index = random.randint(0, len(child)-1)
+        random_index = random.randint(0, len(child) - 1)
         child_list[random_index] = random.choice(genes)
-        
+
     return "".join(child_list)
 
 
@@ -178,8 +178,7 @@ def basic(target: str, genes: list[str], debug: bool = True) -> tuple[int, int,
         # Flush the old population, keeping some of the best evolutions.
         # Keeping this avoid regression of evolution.
         population_best = [
-            item[0]
-            for item in population_score[: int(N_POPULATION / 3)]
+            item[0] for item in population_score[: int(N_POPULATION / 3)]
         ]
         population.clear()
         population.extend(population_best)