Skip to content

Conversation

nazmulwanted
Copy link
Owner

No description provided.

@nazmulwanted nazmulwanted requested a review from Sadman007 June 28, 2022 14:17
@@ -0,0 +1,24 @@
// Time complexity: O(square_root(N) * log(log(N)) , N = Given integer number.
Copy link
Collaborator

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).
Copy link
Collaborator

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)
Copy link
Collaborator

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.

Copy link
Collaborator

@Sadman007 Sadman007 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work! @nazmulwanted

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants