Ad:

Java Discussion Thread
Unsolved
Views: 4909

Oct 5th, 2006

help with recursive method

Expand Post »

can someone explain how i could go about applying this recursive method to a string of integers from a text file.

so far i have read the string into an int array in my main using a tokenizer and im unsure of how i should manipulate the array now.

also does the int list[] parameter in my method need to be initialized even though its being passed to the actual array parameter in the main?

my objective here is to recursively add the array of integers.
any good advice would be appreciated.

Quote ...

static int sumarray(int list[],int size)
{
int currentTotal;
int total;
if ( size == 0 )
total = 0;
else
currentTotal = sumarray( list, size - 1 );
total = currentTotal + list[size - 1];
return total;
}

Similar Threads

permutation of a string in c++ in C++
C++ Performance Tips in C++
Theoretical question: poly root finding (secant method) in Computer Science
recursive linked list in C++
binary search in C

SyLk

Reputation Points: 10

Solved Threads: 0

Light Poster

Offline

27 posts
since Oct 2004

Permalink

Oct 5th, 2006

Re: help with recursive method

The folllowing is some sudo code for addition through recursion:

Java Syntax (Toggle Plain Text)
int sum_recursion(array, size) 
{
   if (size equals to 1) then ( return 0)
   else ( array[size -1] + sum_recursion(array, --size) );
}
int sum_recursion(array, size) 
{
   if (size equals to 1) then ( return 0)
   else ( array[size -1] + sum_recursion(array, --size) );
}

You also have to type cast the the string numbers to integers while adding them, (if you already haven't done so). You should look in you text book if you don't know how to type cast. Hope this qualifies as good advice and good luck.

Last edited by Rayhan Muktader; Oct 5th, 2006 at 4:13 pm.

Rayhan Muktader

Reputation Points: 28

Solved Threads: 3

Light Poster

Offline

30 posts
since Oct 2006

Permalink

Oct 6th, 2006

Re: help with recursive method

I hardly understand what you're doing or why, but here's the recursive solution.. Recursion is unnecessary and stack-dangerous, by the way. (StackOverflowErrors are ugly). Using a StringTokenizer is also unnecessary. I've included two examples, one is Your way, and the other is My way.

Your Way (Recursive and using a StringTokenizer)

Java Syntax (Toggle Plain Text)
public static void main (String[] args) {
	String IntegerString = "1 2 3        4  5     6 7 8   9 10";
 
	StringTokenizer Tokenizer = new StringTokenizer (IntegerString);
 
	int[] ints = new int[Tokenizer.countTokens()];
 
	for (int i = 0; i < ints.length; i++)
		try { ints[i] = Integer.parseInt (Tokenizer.nextToken()); }
		catch (Exception ex) { ints[i] = 0; /* PARSE ERROR */ }
 
	System.out.println ( "The sum of the integers is: " + Summarize (ints, ints.length) );
}
 
public static int Summarize (int[] ints, int curpos) {
	return (--curpos > 0 ? Summarize (ints, curpos) : 0) + ints[curpos];
}
 
// OR
 
public static int Summarize2 (int[] ints, int curpos) {
	if (--curpos < 0) return 0;
	return ints[curpos] + Summarize (ints, curpos);
}
public static void main (String[] args) {
	String IntegerString = "1 2 3        4  5     6 7 8   9 10";
	
	StringTokenizer Tokenizer = new StringTokenizer (IntegerString);
	
	int[] ints = new int[Tokenizer.countTokens()];
	
	for (int i = 0; i < ints.length; i++)
		try { ints[i] = Integer.parseInt (Tokenizer.nextToken()); }
		catch (Exception ex) { ints[i] = 0; /* PARSE ERROR */ }
		
	System.out.println ( "The sum of the integers is: " + Summarize (ints, ints.length) );
}
	
public static int Summarize (int[] ints, int curpos) {
	return (--curpos > 0 ? Summarize (ints, curpos) : 0) + ints[curpos];
}

// OR

public static int Summarize2 (int[] ints, int curpos) {
	if (--curpos < 0) return 0;
	return ints[curpos] + Summarize (ints, curpos);
}

My Way (Quicker, Fewer imports, No recursion)

Java Syntax (Toggle Plain Text)
public static void main (String[] args) {
	String IntegerString = "1 2 3        4  5     6 7 8   9 10";
 
	String[] Tokens = IntegerString.split ("\\s+");
 
	int[] ints = new int[Tokens.length];
 
	for (int i = 0; i < ints.length; i++)
		try { ints[i] = Integer.parseInt (Tokens[i]); }
		catch (Exception ex) { ints[i] = 0; /* PARSE ERROR */ }
 
	System.out.println ( "The sum of the integers is: " + Summarize (ints) );
}
 
public static int Summarize (int[] ints) {
	int Total = 0;
	for (int i : ints) Total += i;
	return Total;
}
public static void main (String[] args) {
	String IntegerString = "1 2 3        4  5     6 7 8   9 10";
	
	String[] Tokens = IntegerString.split ("\\s+");
	
	int[] ints = new int[Tokens.length];

	for (int i = 0; i < ints.length; i++)
		try { ints[i] = Integer.parseInt (Tokens[i]); }
		catch (Exception ex) { ints[i] = 0; /* PARSE ERROR */ }
		
	System.out.println ( "The sum of the integers is: " + Summarize (ints) );
}

public static int Summarize (int[] ints) {
	int Total = 0;
	for (int i : ints) Total += i;
	return Total;
}

Last edited by Cudmore; Oct 6th, 2006 at 6:55 pm. Reason: Improvement

Cudmore

Reputation Points: 20

Solved Threads: 6

Junior Poster in Training

Offline

74 posts
since Nov 2005

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Java Forum Timeline: Escaping

Next Thread in Java Forum Timeline: algorithm problem with recursion

DaniWeb Message

Cancel Changes

User Name
Password