what is the solution(not brute force) for 8th question ?
On Fri, Sep 14, 2012 at 5:19 PM, Bhupendra Dubey bhupendra@gmail.comwrote:
Which edition of barron?
On Wed, Sep 28, 2011 at 6:05 PM, VIHARRI viharri@gmail.com wrote:
1. Java uses stack for byte code in JVM - each instruction
@Bharat: Simulate long division, dividing a number ...1 by the number.
You can do this one digit at a time, printing the quotient digit by digit
until you bring down a zero. It could look something like this:
int n=the number that ends with 3;
int divisor=1;
while( divisor n )
divisor
@all: Please explain question number 8. I am not getting the question
exactly what it says ?
On Fri, Sep 21, 2012 at 9:30 AM, Dave dave_and_da...@juno.com wrote:
@Bharat: Simulate long division, dividing a number ...1 by the number.
You can do this one digit at a time, printing the
