nitin ratra
Greenhorn
Posts: 25
posted 9 years ago
Here's one way (some details have been omitted).
[ August 23, 2008: Message edited by: Garrett Rowe ]
[ August 23, 2008: Message edited by: Garrett Rowe ]
[ August 23, 2008: Message edited by: Garrett Rowe ]
[ August 23, 2008: Message edited by: Garrett Rowe ]
Some problems are so complex that you have to be highly intelligent and well informed just to be undecided about them. - Laurence J. Peter
posted 9 years ago
There's an easier way than what Garrett suggests. Hint: Look at the API documentation of class StringBuilder (or StringBuffer if you're using Java 1.4 or older) and see if there's a method there that you can use.
posted 9 years ago
Please don't go giving out answers like that, SaurabhSri Sri. Read this FAQ. Nitin will learn lots more if you do as Garrett did, leaving out part of the solution to be worked out. I have felt obliged to delete part of your post.
By the way: Use StringBuilder rather than StringBuffer unless you are constrained to use Java 1.4.2 or older.
By the way: Use StringBuilder rather than StringBuffer unless you are constrained to use Java 1.4.2 or older.
Campbell Ritchie
Sheriff
Posts: 57882
178
Campbell Ritchie
Sheriff
Posts: 57882
178
posted 9 years ago
This would be my approach, but I like the String based soluions too.
Originally posted by Campbell Ritchie:
Another way is to set up a recursion using the integer divide / and remainder % operations. I would prefer that way for an exercise myself.
This would be my approach, but I like the String based soluions too.
posted 9 years ago
The String based solution is definitely the easiest. It suits more if you want to reverse a very very long number such as 12345678901123456656795943456989767. That kind of very very long number is cannot be handled by any Java numeric data type.
Hendy Setyo Mulyo
SCJP 1.4 (95%), SCWCD 1.4 (94%)
Campbell Ritchie
Sheriff
Posts: 57882
178
posted 9 years ago
In the old Tenex world, that was a common code sample fragment. At first, it was called "decout" (for decimal out) and you could change the constant that you do the div and mod by to convert it to octal, hex, etc.
later jargon file called it yornp for Ye Olde Recursive Number Printer.
Anyone claiming to speak PDP-10, Tenex, TOPS-10 or TOPS-20 was expected to know it by heart.
Originally posted by Campbell Ritchie:
Another way is to set up a recursion using the integer divide / and remainder % operations. I would prefer that way for an exercise myself.
In the old Tenex world, that was a common code sample fragment. At first, it was called "decout" (for decimal out) and you could change the constant that you do the div and mod by to convert it to octal, hex, etc.
later jargon file called it yornp for Ye Olde Recursive Number Printer.
Anyone claiming to speak PDP-10, Tenex, TOPS-10 or TOPS-20 was expected to know it by heart.
nitin ratra
Greenhorn
Posts: 25
Campbell Ritchie
Sheriff
Posts: 57882
178
