Write a recursive method that converts an integer into its English language Equi

Question

Write a recursive method that converts an integer into its English language Equivalent. intToEnglish(4500007) -> four million five hundred thousand seven

Explanation / Answer

** * Note: this should work for all 0 = 1000000) { numWord.append(numberToWord(n / 1000000)); numWord.append(' '); numWord.append(n_1000000); numWord.append(' '); n %= 1000000; } if (n >= 1000) { numWord.append(numberToWord(n / 1000)); numWord.append(' '); numWord.append(n_1000); numWord.append(' '); n %= 1000; } if (n >= 100) { numWord.append(n_1_9[n / 100]); numWord.append(' '); numWord.append(n_100); numWord.append(' '); n %= 100; } if (n >= 20) { numWord.append(n_20_90[(n / 10) - 1]); numWord.append(' '); n %= 10; } if (n >= 10) { numWord.append(n_10_19[n - 10]); } if (n < 10) { numWord.append(n_1_9[n]); } return numWord.toString().trim(); }

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.