algorithm/Java

Fork 0

mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00

Commit Graph

Author	SHA1	Message	Date
Ivan Kuzaev	22e7f7f147	Update PalindromicPrime.java Method prime(num) uses only odd numbers from 3 to square root of num as divisors. In method functioning(y) we iterate over odd numbers as all even numbers (except of 2) are not prime. In method functioning(y) we check at first if the number is palindrome and then if it's prime, so we don't have to call the heavy prime() method for every number. The speed of searching palindromic primes is significantly increased.	2019-02-03 08:50:02 +03:00
Manmeet Singh	19d311e993	Create Palindromic Prime	2017-10-04 00:22:54 +05:30

Author

SHA1

Message

Date

Ivan Kuzaev

22e7f7f147

Update PalindromicPrime.java

Method prime(num) uses only odd numbers from 3 to square root of num as divisors.
In method functioning(y) we iterate over odd numbers as all even numbers (except of 2) are not prime.
In method functioning(y) we check at first if the number is palindrome and then if it's prime, so we don't have to call the heavy prime() method for every number.
The speed of searching palindromic primes is significantly increased.

2019-02-03 08:50:02 +03:00

Manmeet Singh

19d311e993

Create Palindromic Prime

2017-10-04 00:22:54 +05:30

2 Commits