cupofdenial

You only need to check the multiplicands until the square root of the input, the rest is just repeating... As soon as you find a match, then searching more is not needed, so just "break" the loop. Here's an example: [code=c] int is_it_prime(unsigned long x) { unsigned long i=0; int …

if you are searching for smaller matrix S in a larger matrix L: search for the first element of S, let's say S[1][1] in matrix L, as soon as you find a match keep searching for the immediate matches, if the immediate matches did not exist, then keep going for …