How does return work here?

Question

new question: but why the expression from n == number, from firstFactorPtr == factor1 ?

Can somebody explain me, how this works:

return ( factor ==

Answer 1

It returns the result of the Boolean expression "factor equals 1", i.e., true or false.

This routine also has a side effect: it stores the found factorials in the lists pointed to by the two int * in the header.

In essence, it returns true if the factor is a prime -- the loop counted down all the way to '1' --, false otherwise.