function sum_list ($numbers
{
return array_sum$numbers);
}
Author: ToneDJCampbell
eXorithm – Execute Algorithm: View / Run Algorithm validate_email
function validate_email ($email
{
if (preg_match"%^[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*@(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?$%i", $email))
return true;
else
return false;
}
eXorithm – Execute Algorithm: View / Run Algorithm binary_search
function binary_search ($array, $item, $low, $high
{
if ($low==-1) $low = 0;
if ($high==-1) $high = count$array)-1;
if ($low > $high) {
// item not found
return -1;
}
// get the middle
$middle = floor(($low$high)/2);
if ( $array$middle] == $item ) {
// found it
return $middle
} elseif ($item < $array$middle]) {
// search left
return binary_search$array, $item, $low, $middle-1);
} else {
// search right
return binary_search$array, $item, $middle+1, $high);
}
}
eXorithm – Execute Algorithm: History For Algorithm draw_cube
eXorithm – Execute Algorithm: View / Run Algorithm draw_cube
function draw_cube ($image_size, $degree_x, $degree_y, $degree_z, $vdist, $dist, $vertex_color, $face_color, $wireframe, $dashes, $rainbow
{
$degree_x = $degree_x % 360;
$degree_y = $degree_y % 360;
$degree_z = $degree_z % 360;
// construct the cube polygons
$size = 400; // the size is arbitrary
$x1$size/2;
$x0=-($size/2);
$y1$size/2;
$y0=-($size/2);
$z1$size/2;
$z0=-($size/2);
$sides = array();
$sides[] = array$x0$y0$z0, $x0$y0$z1, $x0$y1$z1, $x0$y1$z0);
$sides[] = array$x1$y0$z0, $x1$y0$z1, $x1$y1$z1, $x1$y1$z0);
$sides[] = array$x0$y0$z0, $x0$y0$z1, $x1$y0$z1, $x1$y0$z0);
$sides[] = array$x0$y1$z0, $x0$y1$z1, $x1$y1$z1, $x1$y1$z0);
$sides[] = array$x0$y0$z0, $x0$y1$z0, $x1$y1$z0, $x1$y0$z0);
$sides[] = array$x0$y0$z1, $x0$y1$z1, $x1$y1$z1, $x1$y0$z1);
// project each of the 6 polygons that makes up the cube
for ($i=0; $icount$sides); $i++) {
$points[] = project_polygon$sides$i], $degree_x, $degree_y, $degree_z, 0, 0, 0, $vdist+($size/2), $dist+($size/2), true);
}
// scale the image somewhat
$scale = $image_size/($size*1.8);
if ($rainbow) {
$face_color = array'ff0000', '00d000', 'ffff00', 'a000a0', '0000ff', 'FF8040');
}
return render_polygons$points, $vertex_color, $face_color, $wireframe, $dashes, $image_size, $scale);
}
eXorithm – Execute Algorithm: Embed Algorithm fibonacci_binet
Embed This Algorithm
This page will help you embed the algorithm fibonacci_binet on a page on your own website. Just configure the inputs, then click the generate button to get a snippet of code you can paste onto your site. You have two options.
- You can embed the entire form. Users will be able to enter their own arguments, and will need to press the run button to execute the algorithm.
- You can add only the output of the algorithm to your website. There will be no argument inputs or run button.
eXorithm – Execute Algorithm: View / Run Algorithm point_in_polygon
function point_in_polygon ($point, $polygon_points
{
  // check points
  if ((count$polygon_points)%2)!=0) {
    throw new Exception'The points must be a list like x1, y1, x2, y2, etc. The number of points therefore must be divisible by two.');
  }
 Â
  // count the number of times a flat line originating from the point and moving right crosses
  // the edges of the polygon -- even number: outside polygon, odd number: inside polygon
  $ints = 0;
 Â
  $count = count$polygon_points);
 Â
  $x = $point[0];
  $y = $point[1];
 Â
  for ($i=2;$i<=$count$i$i+2) {
    $vertex1x = $polygon_points$i-2];Â
    $vertex1y = $polygon_points$i-1];Â
    $vertex2x = $polygon_points$i % count$polygon_points)];
    $vertex2y = $polygon_points[($i+1) % count$polygon_points)];
    // boundary condition: if the point is one of the vertices then we are inside
    if (($x == $vertex1x) && ($y == $vertex1y)) {
      return true;
    }
    if ($vertex1y == $vertex2y) { // horizontal edge
      // boundary condition: if point is on a horizontal polygon edge then we are inside
      if (($vertex1y == $y) && ($x > min$vertex1x, $vertex2x)) && ($x < max$vertex1x, $vertex2x))) {
        return true;
      }
    } else {
      if (($y > min$vertex1y, $vertex2y)) && ($y <= max$vertex1y, $vertex2y)) && ($x <= max$vertex1x, $vertex2x))) {Â
        $xinters = ($y - $vertex1y) * ($vertex2x - $vertex1x) / ($vertex2y - $vertex1y) + $vertex1x;Â
        // boundary condition: if point is on the polygon edge then we are inside
        if ($x == $xinters) {
          return true;
        }
        if ($x < $xinters) {Â
          $ints++;Â
        }
      }Â
    }Â
  }
 Â
  // if line crosses edges even number of times, then we are outside polygon
  if (($ints % 2) == 0) {
    return false;
  } else {
    return true;
  }
}Â
eXorithm – Execute Algorithm: Algorithms Beginning with P
eXorithm – Execute Algorithm: Discuss Algorithm draw_mandelbrot
draw_mandelbrot    version 0.1    Draw the Mandelbrot set fractal. See http://en.wikipedia.org/wiki/Mandelbrot_set
There are no comments yet
New Comment
eXorithm – Execute Algorithm: Embed Algorithm draw_mandelbrot
Embed This Algorithm
This page will help you embed the algorithm draw_mandelbrot on a page on your own website. Just configure the inputs, then click the generate button to get a snippet of code you can paste onto your site. You have two options.
- You can embed the entire form. Users will be able to enter their own arguments, and will need to press the run button to execute the algorithm.
- You can add only the output of the algorithm to your website. There will be no argument inputs or run button.