Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: [Study]: Searching for square roots

by Hofmator (Curate)
on Nov 14, 2006 at 14:17 UTC ( [id://583968]=note: print w/replies, xml ) Need Help??


in reply to Re: [Study]: Searching for square roots
in thread [Study]: Searching for square roots

Nothing is totally wrong :)

The only thing that you did not consider is that x*x < x for x < 1. That's why your code doesn't work for input < 1.

Apart from that a couple of small comments concerning your code.

  • Don't use prototypes for your subroutines unless you know exactly what you are doing.
  • Don't use the variables $a and $b, they are special and used for sort.
  • Instead of writing my ($x, $y, $z) = (shift, shift, shift); simply write my ($x, $y, $z) = @_;.

-- Hofmator

Code written by Hofmator and posted on PerlMonks is public domain. It is provided as is with no warranties, express or implied, of any kind. Posted code may not have been tested. Use of posted code is at your own risk.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://583968]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2024-03-29 10:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found