New Genetic Algorithm solution for Knapsack problem

[Dang-Hoang-Tung]

Describe your change:

Adding a genetic algorithm solution for the knapsack problem, one of the famous combinatorial optimization problems.

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 enough).

• [x] Add an algorithm?
• [ ] Fix a bug or typo in an existing algorithm?
• [ ] Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• [ ] Documentation change?

Checklist:

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized.
• [x] I know that pull requests will not be merged if they fail the automated tests.
• [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [x] All new Python files are placed inside an existing directory.
• [x] All filenames are in all lowercase characters with no spaces or dashes.
• [x] All functions and variable names follow Python naming conventions.
• [x] All function parameters and return values are annotated with Python type hints.
• [x] All functions have doctests that pass the automated testing.
• [x] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• [x] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

[Tarannum9623]

Hi! Can you help me by telling why my build test is failing, I want to contribute search_in_a_rotated_sorted_array in search directory and my build test failed. PR: Search in rotated sorted array #13245