递归算法--进制数实现

递归算法，就是一种直接或者间接地调用自身的算法。递归算法的具体实现过程一般通过函数或子过程来完成，在函数或子过程的内部，编写代码直接或者间接地调用自己，即可完成递归操作。

 

/*

 * 十进制n转换为b进制

 */

public class Conversion {

    public void conversion(StringBuffer str,int n,int b){

       String[] s ={"0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"};

       if(n/b==0){

           str.append(s[n%b]);

           return;

       }

       conversion(str,n/b,b);

       str.append(s[n%b]);

    }

    public static void main(String[] args) {

       Conversion c = new Conversion();

       StringBuffer str = new StringBuffer();

       c.conversion(str,121,2);

       System.out.println(str);

    }

}