Hi, all.  I found a Euclidean algorithm for finding the HCF of two numbers

and decided to code it :



int Find_HCF(int X, int Y) {

        if (X > Y) return (Find_HCF(Y, X));

        if ((Y % X) == 0) return X;

        return Find_HCF((Y % X), X);

}



Do any of you have similar sorts of routines (including that one for the

Sieve of Eratosthenes(sp?) that was discussed recently) ???  Source please :)



Chow.



Junyer Hakker.



--- PPoint 2.00