Algorithm - Part 13

eXorithm – Execute Algorithm: View / Run Algorithm draw_playing_card

December 3, 2017 by ToneDJCampbellin View

eXorithm – Execute Algorithm: View / Run Algorithm isbn_validator

November 28, 2017September 24, 2019 by ToneDJCampbellin View

function isbn_validator ($isbn
{
  $isbnpreg_replace'/[^dX]/'''$isbn);  //remove all non-numeric or X chars
  $casestrlen$isbn);
  switch ($case
  {
    case 10:
      if(!isbn_validate$isbn, 2))
        return 0;  //Failure - not valid ISBN
      else
        $isbnconv_isbn$isbn);
      break
    case 13:
      $isbnpreg_replace'/[^d]/'''$isbn);  //remove all non-numeric chars
      if(!isbn_validate$isbn, 1))
        return 0;  //Failure - not valid ISBN
      break
    default
      return 0;
  }
  $isbnisbn_hyphenate$isbn);
  return $isbn
}

Make Change

November 25, 2017 by ToneDJCampbellin Source

<?php

/**
 * make_change
 *
 * Calculate the number of different ways there are to make change for a given amount.
 *
 * @version 0.1
 * @author Contributors at eXorithm
 * @link /algorithm/view/make_change Listing at eXorithm
 * @link /algorithm/history/make_change History at eXorithm
 * @license /home/show/license
 *
 * @param number $amount How many cents you want to make change for.
 * @param array $coins The coin denominations you have.
 * @return mixed
 */
function make_change($amount=100,$coins=array(0=>'1',1=>'5',2=>'10',3=>'25'))
{
	$coin_count = count($coins);
	
	$table = array();
	
	for ($i = -1; $i <= $amount; $i++) {
		for($j = -1; $j <= $coin_count; $j++) {
			// Rules
			// 1: table[0,0] or table[0,x] = 1
			// 2: talbe[i <= -1, x] = 0
			// 3: table[x, j <= -1] = 0
			
			$total = 0;
				 
			// first sub-problem
			// count(n, m-1)
			$n = $i;
			$m = $j-1;
			if ($n == 0) // rule 1
				$total += 1;
			else if ($n <= -1) // rule 2
				$total += 0;
			else if (($m <= 0) && ($n >= 1))
				$total += 0;
			else
				$total += $table[$n][$m];
			
			// second sub-problem
			// count(n-S[m], m)
			if (($j-1) <= -1)
				$total += 0;
			else {
				$n = $i - $coins[$j - 1];
				$m = $j;
				if ($n == 0) // rule 1
					$total += 1;
				else if ($n <= -1) // rule 2
					$total += 0;
				else if (($m <= 0) && ($n >= 1)) // rule 3
					$total += 0;
				else
					$total += $table[$n][$m];
			}
			
			$table[$i][$j] = $total;
		}
	}
	return $table[$i-1][$j-1];
}

?>

eXorithm – Execute Algorithm: View / Run Algorithm unique_image

November 23, 2017September 24, 2019 by ToneDJCampbellin View

function unique_image ($string
{
  $size=200;
  $steps=5;
  $step$size$steps
  
  $image = image_create_alpha$size, $size);
  
  $n = 0;
  $prev = 0;
  $len = strlen$string);
  $sum = 0;
  for ($i=0;$i$len$i++) $sum += ord$string$i]);
  
  for ($i=0;$i$steps$i++) {
    for ($j=0;$j$steps$j++) {
      $letter = $string$n++ % $len];
      
      $u = ($n % (ord$letter)+$sum)) + ($prev % (ord$letter)+$len)) + (($sum-1) % ord$letter));
      $color = imagecolorallocate$image, pow$u$prev$u$prev+5,2)%256, pow$u$prev$u$prev+3,2)%256, pow$u$prev$u$prev+1,2)%256);
      if (($u%2)==0)
        imagefilledpolygon$image, array$i$step, $j$step, $i$step$step, $j$step, $i$step, $j$step$step), 3, $color);
      $prev = $u
      
      $u = ($n % (ord$letter)+$len)) + ($prev % (ord$letter)+$sum)) + (($sum-1) % ord$letter));
      if (($u%2)==0)
        imagefilledpolygon$image, array$i$step, $j$step$step, $i$step$step, $j$step$step, $i$step$step, $j$step), 3, $color);
      $prev = $u
    
    }
  }
  
  return $image
}

eXorithm – Execute Algorithm: View / Run Algorithm morse

November 20, 2017 by ToneDJCampbellin View

eXorithm – Execute Algorithm: View / Run Algorithm get_average_color

November 20, 2017 by ToneDJCampbellin View

eXorithm – Execute Algorithm: View / Run Algorithm calendar_month

November 16, 2017 by ToneDJCampbellin View

Show Address

November 15, 2017 by ToneDJCampbellin Source

<?php

/**
 * show_address
 *
 * Given an address, show the location on a map.
 *
 * @version 0.6
 * @author Contributors at eXorithm
 * @link /algorithm/view/show_address Listing at eXorithm
 * @link /algorithm/history/show_address History at eXorithm
 * @license /home/show/license
 *
 * @param mixed $address The address to find.
 * @return array latitude/longitude
 */
function show_address($address='The White House
1600 Pennsylvania Ave NW
Washington, DC
20500')
{
	$data = file_get_contents("http://maps.googleapis.com/maps/api/geocode/json?address=".urlencode($address)."&sensor=false");
	$obj = json_decode($data);
	if ($obj) {
		if (isset($obj->results[0]->geometry->location)) {
			$loc = $obj->results[0]->geometry->location;
			return array('latitude'=>$loc->lat, 'longitude'=>$loc->lng);
		} else {
			throw new Exception('Lookup failed and/or address does not exist!');
		}
	} else {
		throw new Exception('Lookup failed and/or address does not exist!');
	}
}

?>

eXorithm – Execute Algorithm: History For Algorithm fibonacci_binet

November 11, 2017September 24, 2019 by ToneDJCampbellin Edit

fibonacci_binet Â Â Â version 0.3 Â Â Â Simple example of Fibonacci series algorithm using Binet

eXorithm – Execute Algorithm: View / Run Algorithm factorial

November 10, 2017 by ToneDJCampbellin View

function factorial ($number { $factorial = 1; while$number > 1) { $factorial *= $number $number--; } return $factorial }

Version	Note	Created	Diff
0.3 [edit		Nov 23, 2011 01:39 am by Mike Campbell
0.2 [revert		Nov 20, 2011 11:15 pm by ekajjake
0.1 [revert		Aug 30, 2011 06:55 am by estrella