Menu
Hi guys,
Here is the method that I wrote to convert a number from binary to decimal.
public static void binary2decimal(int a){
String r=a+””;
double sum=0;
for(int i=0;i<r.length();i++){
if(r.charAt(i)==’1′){
double product=1;
for(int q=0;q<r.length()-i-1;q++){
product=product*2;}
sum=sum+product;}
else if(r.charAt(i)==’.’){
int pos=i+1;
while(r.charAt(pos)==’1′){
double prod=1;
for(int q=0;q<r.length()-pos-1;q++){
prod=prod
pos++;
if(pos==r.length()-1){
break;}}
sum=sum+prod;}}}
System.out.println(sum);
}
//————————————
How can I write it this method recursively?????