C# Online Compiler | .NET Fiddle

<no name> by Anonymous

using System;

namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args) { Console.WriteLine(FactorialPrimarySum(8)); }
        public static int SumN(int n) //1#
        {
            if (n == 1)
            {
                return 1;
            }
            return n + SumN(n - 1);
        }
        public static int SumArray(int[] data, int i)
        {
            if (i == 0)
            {
                return data[0];
            }
            return i + SumArray(data, i - 1);
        }
        public static int MaxInArray(int[] data, int i)
        {
            if (i == 0)
            {
                return data[i];
            }
            return Math.Max(data[i], MaxInArray(data, i - 1));
        }
        public static int FactorialSum(int n)//2#
        {
            if (n == 1)
            {
                return 1;
            }
            return n *= FactorialSum(n - 1);
        }
        public static int FactorialPrimarySum(int n)//3#
        {
            if (n == 1)
            {
                return 1;
            }
            if (n % 2 == 0)
            {
                return  FactorialPrimarySum(n - 1);
            }
            else
            {
                return n + FactorialPrimarySum(n - 1);
            }
        }
        public static int //4#
    }
}

​x
 
using System;
​
namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args) { Console.WriteLine(FactorialPrimarySum(8)); }
        public static int SumN(int n) //1#
        {
            if (n == 1)
            {
                return 1;
            }
            return n + SumN(n - 1);
        }
        public static int SumArray(int[] data, int i)
        {
            if (i == 0)
            {
                return data[0];
            }
            return i + SumArray(data, i - 1);
        }
        public static int MaxInArray(int[] data, int i)
        {
            if (i == 0)
            {
                return data[i];
            }
            return Math.Max(data[i], MaxInArray(data, i - 1));
        }
        public static int FactorialSum(int n)//2#
        {
            if (n == 1)
            {
                return 1;
            }
            return n *= FactorialSum(n - 1);
        }
        public static int FactorialPrimarySum(int n)//3#
        {
            if (n == 1)
            {
                return 1;
            }
            if (n % 2 == 0)
            {
                return  FactorialPrimarySum(n - 1);
            }
            else
            {
                return n + FactorialPrimarySum(n - 1);
            }
        }
        public static int //4#
    }
}
​

ABOUT US
========

We are a group of .NET developers who are sick and tired of starting Visual Studio, creating a new project and running it, just to test simple code or try out samples from other developers.

This tool was inspired by http://jsfiddle.net, which is just awesome.

If you are interested in working on .NET Fiddle please send your resume and links to a couple of your best fiddles to dotnetfiddle at entechsolutions dot com. The most impressive fiddle will get the job.

ENTech Solutions
http://www.entechsolutions.com

Cached Result
Last Run:	10:29:12 pm
Compile:	0.129s
Execute:	0s
Memory:	0b
CPU:	0.016s

View IL Code