Skip to content
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

Jump to bottom

Add big-O time-complexity for the following functions #103

Open
saxbophone opened this issue May 27, 2022 · 1 comment
Open

Add big-O time-complexity for the following functions #103

saxbophone opened this issue May 27, 2022 · 1 comment
Labels
documentation Improvements or additions to documentation help wanted Extra attention is needed

Comments

@saxbophone
Copy link
Owner

image

Note: most, if not all of these are reliant upon a time-complexity estimate for divmod() before they can be estimated.
@saxbophone saxbophone added the documentation Improvements or additions to documentation label May 27, 2022
@saxbophone
Copy link
Owner Author

Divmod might be $\mathcal{O}(n^2)$, $\mathcal{O}(n^3)$ or $\mathcal{O}(n^2log{}(n) + n^2)$

@saxbophone saxbophone added the help wanted Extra attention is needed label May 27, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
documentation Improvements or additions to documentation help wanted Extra attention is needed
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@saxbophone