belushkin

package recfun
import common._

object Main {
  def main(args: Array[String]) {
    println("Pascal's Triangle")
    for (row <- 0 to 10) {
      for (col <- 0 to row)
        print(pascal(col, row) + " ")
      println()

belushkin

<?php

// Regular recursion
function factorial ($n)
{
    if ($n == 1 ) {
        return 1;
    }
    return $n * factorial($n-1);
}

belushkin

function pascal_triangle($c, $r)
{
    if ($c == 0 || $c == $r) {
        return 1;
    } else {
        return pascal_triangle($c-1, $r-1) + pascal_triangle($c, $r - 1);
    }
}

echo pascal_triangle(1,3), "\n";

belushkin

<?php

// (if (zero? x) max (/ 1 x))
function balance($str)
{
    function loop($str, $acc)
    {
        if (empty($str)) {
            return $acc == 0;
        }

belushkin

<?php

$n = 236;

function reverse($n){
    if (strlen($n)==0) {
        return '';
    }
    return substr($n, -1) . reverse(substr($n, 0, -1));
}

belushkin

<?php

function isPalindrome(String $n) 
{ 
    if (strlen($n) == 1) {
        return $n;
    } else {
        $res = $n[0] + isPalindrome(substr($n, 1));
    }

belushkin

<?php

function sumDigits($n) 
{  
    return ($n == 0) ? 0 : $n%10 + sumDigits($n/10);
} 
  
// Driver Code 
$n = 687; 
$res = sumDigits($n); 

belushkin

<?php
// A recursive PHP program to
// check whether a given number
// is palindrome or not

// A function that reurns true
// only if num contains one digit
function oneDigit($num)
{
    // comparison operation is faster

belushkin

belushkin