adding a split_workload algorithm

[meg-1]

Describe your change:

This algorithm is a brute-force search over (nearly) all 2^n possible partitions and was created for educational purposes. The asymptotic runtime of this code is: O(n * 2^n) this is a case of the partition problem. It accepts a multiset ( list ) of integers, distributes them, and returns a tuple, containing two lists, with minimal difference between their sums.

• [x] Add an algorithm?
• [ ] Fix a bug or typo in an existing algorithm?
• [ ] 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".

[meg-1]

@cclauss, was wondering if you could check this pr out? would be very appreciated! all checks pass, all that's needed is an approving review :))