[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

genetic_algorithm/knapsack.py

@@ -4,7 +4,7 @@
 It is commonly known that combinatorial optimization problems can be solved using
 dynamic programming. It is lesser known that genetic algorithms (or evolutionary
 computing in general) can reach the best solution fairly quickly in a lot of cases.
-Otherwise, it can still approximate a very good solution (in life, good is good 
+Otherwise, it can still approximate a very good solution (in life, good is good
 enough).
 
 Genetic algorithms: https://en.wikipedia.org/wiki/Genetic_algorithm