CareerCup

python code but I am sure you are looking for ideas:

def sum(x, max):
	if x == max:
		return max
	return x+sum(x+1, max)

print(sum(4, 7))

python code but I am sure you are looking for ideas:

def sum(x, max):
	if x == max:
		return max
	return x+sum(x+1, max)

print(sum(4, 7))

python code but I am sure you are looking for ideas:

def sum(x, max):
	if x == max:
		return max
	return x+sum(x+1, max)

print(sum(4, 7))

int sum(int x, int max){
	if(max == x)
		return max;
	else
		return max + sum(x, max-1);
}

python code but I am sure you are looking for ideas:

def sum(x, max):
	if x == max:
		return max
	return x+sum(x+1, max)

print(sum(4, 7))

int sum(int x, int max){
	if(max == x)
		return max;
	else
		return max + sum(x, max-1);
}

public static int sum(int x, int max){
		if(x==max)
		  return max;
		else 
			return x + sum(x+1,max);
	}

Python one-line:

summ = lambda f, t: f if f == t else f + summ(f + 1, t)

JavaScript solution:

var sum = function(min, max) {
	if (min === max) {
		return max;
	}
	return min + countMachine(min + 1, max);
}

public int findRecursiveSum(int num, int maxNumber) {
		if (num == maxNumber)
			return num;
		else
			return num + findRecursiveSum(num + 1, maxNumber);
	}

public int findRecursiveSum(int num, int maxNumber) {
		if (num == maxNumber)
			return num;
		else
			return num + findRecursiveSum(num + 1, maxNumber);
	}

public static void calcSum(int from, int to, int sum) {

        sum = from + sum;

        if(from == to) {
            System.out.println(sum);
            return;
        }

        calcSum(from+1, to, sum);
    }

public class recursiveQtn {
    public recursiveQtn() {
        super();
    }

    public static void main(String[] args) {
        //recursiveQtn recursiveQtn = new recursiveQtn();
        int min; 
        min = new Integer(args[0]).intValue();
        int max;
        max = new Integer(args[1]).intValue();
        if (min>max)
            System.out.println("Min cannot be more than max"); 
        recursiveQtn mobj = new recursiveQtn();
        System.out.println(mobj.sum(min,max)); 
            
    }
    public int sum ( int min , int max )
         { if ( min == max ) 
             return min; 
            else 
               return max + sum (min , max-1 );
          }
}

#include<stdio.h>
int recurcal(int x,int y){
if(x>y)
return 0 ;
return (x+(recurcal(x+1,y)));

}
int main(){
printf("%d",recurcal(4,7));
return 0;
}

int sum(int x, int max)
{
   return x > max ? 0 : x + sum(x + 1, max);
}

#include <stdio.h>

int rec_sum(int b, int e)
{
	if(b == e)
		return;
	else
		return (b + rec_sum(b + 1, e));
}

int main(int argc, char *argv[])
{
	int sum = rec_sum(1, 10);
	printf("Sum: %d\n", sum);
	return 0;
}

int sum(int x,int y)
{
if((y-x)==1)
return (x+y);
else
return x+sum(x+1,y);
}

int sum(static int x,static int max )
{
/* complete the code */
static int sum;
sum(sum + x++ + max--);
if(x>max)
return sum;
}

long sum(int x,int max){
static long res;
if(x>max)return res;
else{
res=res+x;
sum(x+1,max);}}

long sum(int x,int max)
{
static long res;
if(x>max)return res;
else{
res=res+x;
sum(x+1,max);
}
}

#include<stdio.h>
int Sum(int,int);
int main()
{
int sum=Sum(4,7);
printf("Sum= %d",sum);
return 0;
}
int Sum(int a, int b){
if(a>b)
return 0;
else
return a+Sum(a+1,b);
}