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
..
heap_sort.java	Modified Data Misc folder .java file name and class name	2017-12-17 01:20:22 +09:00
MedianOfRunningArray.java	Add Median Of Running Array	2018-10-11 11:25:26 +05:30
PalindromicPrime.java	Update PalindromicPrime.java	2019-02-03 08:50:02 +03:00