Question

IN PYTHON!

Radix Conversion(*UP TO BASE 37*)

Constraints:

• Use only basic arithmetic and comparison operations. Do not make any function calls other than the recursive call to convertBase

Write a recursive function: convertBase(n,base) that will convert the non-negative decimal number n (type integer) to the specified base and return it as a string. Note that decimal values can be converted to a different number base by repeatedly dividing the residual quotient of n // base until it is zero, then arranging the remainders in reverse. e.g., to convert 3510 to base 2:

35 // 2 ==> 17, remainder 1 ('1')

17 // 2 ==> 8, remainder 1 ('1')

8 // 2 ==> 4, remainder 0 ('0')

4 // 2 ==> 2, remainder 0 ('0')

2 // 2 ==> 1, remainder 0 ('0')

1 // 2 ==> 0, remainder 1 ('1')

3510 == 1000112

Number bases greater than 10 employ successive alphabetic letters to represent digit values greater than 9. For example, 1010 is represented using the letter 'A', 1110 is 'B' is, 1210 is 'C' and so on. e.g., 2710 converted to base 16:

27 // 16 ==> 1, remainder 11 ('B')

1 // 16 ==> 0, remainder 1 ('1')

2710 == 1B16

[Hint: use direct look-up on an alphabet string to convert the remainder "digit" to its character equivalent]

Example:

>>> convertBase(47,2) 101111

>>> convertBase(47,16) 2F

Here is what i have so far: I Just don't know how to change the remainder "digit" to an alphabet:

def convertBase(n,base):
add = n%base
if n<=1:
return str(n)
else:
return str(convertBase(n//base,base)) + str(add)