Calculating a factorial N!

Recursion solution

        public static long fact(long n)
        {            
            if (n == 0) return 1;

            return n * fact(n - 1);
        }

and with loop

        public long fact(long n)
        {
            if (n == 0) return 1;

            long f = 1;
            for (long i = 1; i <= n; i++)
            {
                f *= i;
            }

            return f;            

        }
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s