Create SieveofEratosthenes.java

[Faiziimam]

Problem

-The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million

Solution

-transform property added to box-item on hover

• Sieve of Eratosthenes is a simple and ancient algorithm used to find the prime numbers up to any given limit. It is one of the most efficient ways to find small prime numbers. For a given upper limit n the algorithm works by iteratively marking the multiples of primes as composite, starting from 2