Fingers | Value | |
---|---|---|
f | 1 | |
ff | 2 | |
fff | 3 | |
ffft | 4 | |
ffftf | 5 | |
ffftff | 6 | |
ffftfff | 7 | |
ffftffft | 8 |
CONVERT-TO-BASE-10 Input: a string of digits S and an integer base b Assume s[n-1] is the most significant digit and s[0] is the least. Output: an integer
- let n = length of S
- let sum = 0
- for i = n-1 to 0
- sum = sum + s[i] * pow(base, i)
- return sum