arhin
asked on
Recursive
I need to write a recursive method that displays a non negative integer with commas in the correct locations. For example, it should display: 20131 as 20,131.
I need to write a program to test the recursive method. Using Boolean value to distinguish the first recursive copy from the remaining ones.
Show the output for the 3 separate numbers: 43, 648 148, 348, 245 349
I need to write a program to test the recursive method. Using Boolean value to distinguish the first recursive copy from the remaining ones.
Show the output for the 3 separate numbers: 43, 648 148, 348, 245 349
robthewolf
Is this academic? If so please try to do it yourself and post questions and code when you get stuck. No one will give you the answer if this is academic work that you are supposed to do yourself. If it is not academic please explain why you need to do it recursively.
ASKER
If you can help in another way then please go ahead. You need not handle it recursively. Its my own work. Its not academic
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
A number formatter will do exactly what the asker wants to achieve and very simply. I have given plenty of resources and examples on other sites for the asker to implement what they need. Given the askers comment that it does not have be recursive I feel that I have answered this question satisfactorily.
I am interested in the outcome, mainly to understand what was wrong with my suggestion, or alternatively to see that the asker understands how my suggestion will solve their problem.