Why do the following algorithms for Quadratic Primes perform so differently?
Well, I finally find out I'm just writing bad code that results in too many computations.
The condition in slow() should be P[i*i+a*i+b] != 1 instead of P[..] == 0 because there are cases when the index is smaller than 0.