hacktoberfest icon indicating copy to clipboard operation
hacktoberfest copied to clipboard
verified publisher icon sbmxc

Find prime number till n number in O(log n) complexity using DP

Open Raghavagr opened this issue 4 years ago • 0 comments

Added an algorithm to find a prime number in order of log n complexity and the algorithm in dynamic programming is known as Sieve of Eratosthenes.

Raghavagr avatar Oct 19 '21 09:10 Raghavagr