question-mark
Stuck on an issue?

Lightrun Answers was designed to reduce the constant googling that comes with debugging 3rd party libraries. It collects links to all the places you might be looking at while hunting down a tough bug.

And, if you’re still stuck at the end, we’re happy to hop on a call to see how we can help out.

Prime Factorising an Integer in O(logN) time (Using seive of Eratosthenes)

See original GitHub issue

🚀 Feature

Prime Factorising a number in O(logN).

Have you read the Contribution Guidelines?

Yes

Pitch

Prime factorising a number in the normal method takes O(sqrt(N)) time. But using seive of eratosthenes we can do the job in O(logN) time.

Assignees

@ankur-kayal - C++ @Pratap2018 - Java @GarimaMahajan20 - C

Issue Analytics

  • State:open
  • Created 3 years ago
  • Comments:11 (11 by maintainers)

github_iconTop GitHub Comments

2reactions
Pratap2018commented, Oct 1, 2020

@aditik03 Pull request added

1reaction
aditik03commented, Oct 1, 2020

@aditik03 Pull request added

@Pratap2018 merged 😃

Read more comments on GitHub >

github_iconTop Results From Across the Web

Prime Factorization using Sieve O(log n) for multiple queries
To calculate to smallest prime factor for every number we will use the sieve of eratosthenes. In original Sieve, every time we mark...
Read more >
Prime Factorisation Method Using Sieve O(log n) For Multiple ...
Prime factorisation method using Sieve is the most efficient method to determine the prime factors of a given number. Read on to know...
Read more >
Prime Factorization In log(n) After Sieve - Codeforces
We use Eratosthenes sieve for prime factorization, storing the primes in an array. But for that, we need to find the primes less...
Read more >
Prime Factorization using Sieve O(log n) for multiple queries ...
The solution to the problem is found by finding the smallest factor that divides the number, saving it as a factor and updating...
Read more >
Sieve of Eratosthenes: Finding All Prime Numbers - InterviewBit
Firstly write all the numbers from 2,3,4…. · Now take the first prime number and mark all its multiples as visited. · Now...
Read more >

github_iconTop Related Medium Post

No results found

github_iconTop Related StackOverflow Question

No results found

github_iconTroubleshoot Live Code

Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start Free

github_iconTop Related Reddit Thread

No results found

github_iconTop Related Hackernoon Post

No results found

github_iconTop Related Tweet

No results found

github_iconTop Related Dev.to Post

No results found

github_iconTop Related Hashnode Post

No results found