Skip to content

/ C-Plus-Plus

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

Jump to bottom

Added find factors of any number in Osqrt(n) time #570

Open
Kunal614 opened this issue Oct 23, 2019 · 4 comments
Open

Added find factors of any number in Osqrt(n) time #570

Kunal614 opened this issue Oct 23, 2019 · 4 comments

Comments

@Kunal614
Copy link

@Kunal614 Kunal614 commented Oct 23, 2019

Kunal614@05d8f9e
@Baranixowy
Copy link

@Baranixowy Baranixowy commented Nov 19, 2019

Check my update.
@Kunal614
Copy link
Author

@Kunal614 Kunal614 commented Nov 19, 2019

What you updated?
@Baranixowy
Copy link

@Baranixowy Baranixowy commented Nov 19, 2019

change prime factor finder and add all divider function
@Kunal614
Copy link
Author

@Kunal614 Kunal614 commented Nov 21, 2019

Ok that's good.
If you have different algorithm then add it.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Linked pull requests

Successfully merging a pull request may close this issue.

None yet
2 participants
@Kunal614 @Baranixowy
You can’t perform that action at this time.