-
Notifications
You must be signed in to change notification settings - Fork 0
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.
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
Submission Week Eight #8
base: master
Are you sure you want to change the base?
Conversation
@@ -0,0 +1,24 @@ | |||
// Time complexity: O(square_root(N) * log(log(N)) , N = Given integer number. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It's O(N * log(log(N)))
. Not O(sqrt(N) * log(log(N)))
.
@@ -0,0 +1,11 @@ | |||
//Time complexity: O(Count of 5 in the n's factorial's divisors). |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
which is, in worst case, O(log5(N))
.
@@ -0,0 +1,20 @@ | |||
// Time complexity: O(log N), N is the power of the base. | |||
// Space complexity: O(1) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It is O(log(N))
too. Think why.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice work! @nazmulwanted
No description provided.