Create number container system algorithm

[CaedenPH]

Describe your change:

Implements a number container system algorithm which stores indexes and numbers at these corresponding indexes.

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Checklist:

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

[algorithms-keeper]

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

• Contributing guidelines
• Project Euler solution guidelines

Python:

• Formatted string literals (f-strings)
• Type hints
• doctest
• unittest
• pytest

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

---

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

• @algorithms-keeper review to trigger the checks for only added pull request files
• @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

[cclauss]

This looks cool!!

How does it perform on long lists of numbers?

from random import shuffle
numbers = list(range(10_000))
shuffle(numbers)
binary_search_delete(numbers, 5_000)

[CaedenPH]

This looks cool!!

How does it perform on long lists of numbers?

from random import shuffle
numbers = list(range(10_000))
shuffle(numbers)
binary_search_delete(numbers, 5_000)

Good idea, I can add some timeit methods to show the scalability of this algorithm.

Note that binary search requires a sorted array so shuffle cannot be used

[CaedenPH]

@cclauss I have added more tests to both insert and delete functions along with allowing not only list of ints but also strings and range objects.
I'm not sure if implementing benchmarks is necessary because none of the search or sort algorithms have benchmarks unless they are being compared to other methods