Skip to content

Small docstring time complexity fix in number_container _system #8875

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Jul 22, 2023
Merged

Small docstring time complexity fix in number_container _system #8875

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
15776f5
fix: Write time is O(log n) not O(n log n)
CaedenPH Jul 22, 2023
34dd890
Merge branch 'TheAlgorithms:master' into master
CaedenPH Jul 22, 2023
d7bb049
chore: Update pre-commit ruff version
CaedenPH Jul 22, 2023
4ab5709
revert: Undo previous commit
CaedenPH Jul 22, 2023
648ad22
Merge branch 'TheAlgorithms:master' into master
CaedenPH Jul 22, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion other/number_container_system.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
"""
A number container system that uses binary search to delete and insert values into
arrays with O(n logn) write times and O(1) read times.
arrays with O(log n) write times and O(1) read times.
This container system holds integers at indexes.
Expand Down