Re: Parallel program to calculate PI

On 13 May, 16:02, Pietro Cerutti <gahr@[EMAIL PROTECTED]
> wrote:
> Prime Mover wrote:
> > % descriptive algorithm:
> > 1. Inscribe a circle inside a square
> > 2. Generate random points inside the square
> > 3. Determine the number of points that fell inside the circle
>
> How can you determine it without knowing PI a priori?

Imagine a circle with radius is 1 and its center has coordinates
(0 , 0).
A random point with coordinates (x,y) will be inside the square
if -1 <= x <= 1 and -1 <= y <= 1
if ( x*x + y*y < 1) /* inside the circle */