[iDama03]

sure... its this

public static int  binToDec (String binString)
	{
		int num= 0;
		int base =2;

		int length = binString.length();
			for (int i = length - 1; length > i;)
			{
				num = Integer.parseInt(binString, base);
				if ((num== '0') && (num == '1'))
				{
			
					      num +=(Math.pow(2, base));
			     }
				i++;
				return num;
				
			}
			return num = binToDec (binStr) + num;
		
		
	}

This post has been edited by pbl: 05 March 2012 - 07:49 PM
Reason for edit:: Code tags added. One day you will learn :code:

[pbl]

Don't want to disappoint you but

1) you use Integer.parseInt(string, base);

you could have use only that method to do all the job, doubt your teacher gives you marks for that

2) your method is not really recursive


3) your return num;

happens at the first iteration of the for() loop so why making a loop ?

4) and the worst of it:

if ((num== '0') && (num == '1'))

How can num == '0' AND num == '1' at the same time ?

I think you still have some work to do

This post has been edited by pbl: 05 March 2012 - 08:10 PM