adamcrussell has asked for the wisdom of the Perl Monks concerning the following question:
will take a $w=1 and give me a $n=1, $w=25 results in a $n=2$c=$w%24; if($c==0){$c=24;}#nobody says 0 o'clock instead of 12 o'clock do they? + >:) $r=ceil($w/24); $n=(($c-1)*16)+$r;
The problem is that when I implement the java analogue of the perl code:
a w=1 result in an n=0, w=25 results in an n=1 .int c=w%24; double r=Math.ceil(w/24); if(c==0){c=24;} Double d=new Double(((c-1)*16)+r);//This line and the next line are ne +cessary because ceil() returns a double int n=d.intValue();
Why is this? Also, in the larger scope of things, is prototyping algorithms in perl to be implemented in another language a stupid idea likley to have me meet more trouble down the road?
Edit by dws for typos and formatting
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: perl to protoype algorithms
by Juerd (Abbot) on Jun 12, 2002 at 19:19 UTC | |
| |
|
Re: perl to protoype algortithms
by c-era (Curate) on Jun 12, 2002 at 18:47 UTC | |
by adamcrussell (Hermit) on Jun 12, 2002 at 18:51 UTC | |
|
Re: perl to protoype algorithms
by jsprat (Curate) on Jun 12, 2002 at 20:00 UTC | |
by BrowserUk (Patriarch) on Jun 12, 2002 at 22:25 UTC |