Reply to thread

Message: <blockquote data-quote="Im.Just.a.Fool" data-source="post: 4272141" data-attributes="member: 186898">chamidilkoya prime numbers check karana kramaya hari. n is a prime if it is not divisible by x (2 <= x <= sqrt<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down    (n)" loading="lazy" data-shortname="(n)" /> ) . ea range eke numbers walin n bedenawada kiyala check karana kramaya thamai fast ma method eka. iratte sankya check kale nathnam program eka thawath fast wenawa. Because there is a 50% chance that any given integer is divisible by 2.  [CODE]    [COLOR=Green]// This method assumes n is a non-negative integer, because     // prime numbers start with 2.[/COLOR]    boolean isPrime(int n) {        if (n < 2) return false;           if (n == 2) return true;        if (n % 2 == 0) return false;        for (int i = 3; i*i <= n; i+=2)            if (n % i == 0) return false;        return true;    }[/CODE]</blockquote>

Top Bottom