Add Optimized Shell Sort

[ZicsX]

Describe your change:

Added a new shell sort implementation which is slightly faster than its pure implementation.

This shell sort is implemented using a gap, which shrinks by a certain factor each iteration. In this implementation, the gap is initially set to the length of the collection. The gap is then reduced by a certain factor (1.3) each iteration.

For each iteration, the algorithm compares elements that are a certain number of positions apart (determined by the gap). If the element at the higher position is greater than the element at the lower position, the two elements are swapped. The process is repeated until the gap is equal to 1.

The reason this is more efficient is that it reduces the number of comparisons that need to be made.
By using a smaller gap, the list is sorted more quickly.

"""

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

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 have a URL in its comments that points to Wikipedia or other similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[ghost]

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.

[poyea]

Thank you for your pull request!🤩

[poyea]

2022-07-03T16:34:40.6973928Z ==================================== ERRORS ====================================
2022-07-03T16:34:40.6974259Z _______________ ERROR collecting quantum/ripple_adder_classic.py _______________
2022-07-03T16:34:40.6974616Z quantum/ripple_adder_classic.py:6: in <module>
2022-07-03T16:34:40.6975140Z     from qiskit.providers import BaseBackend
2022-07-03T16:34:40.6975800Z E   ImportError: cannot import name 'BaseBackend' from 'qiskit.providers' (/opt/hostedtoolcache/Python/3.10.5/x64/lib/python3.10/site-packages/qiskit/providers/__init__.py)
2022-07-03T16:34:40.6976280Z =============================== warnings summary ===============================

Seems unrelated.

[poyea]

@ZicsX You may merge the main branch again because of 9135a1f

[stale]

This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.