数据结构与算法之递归算法 C++和PHP实现

#include<iostream>
int factorial(int n);
int main()
{
    using namespace std;
    int n;
    cout << "请输入一个数字:";
    cin >> n;
    cout << n << "的阶乘为: " << factorial(n) <<endl;
    return 0;
}
int factorial(int n)
{
    if (n == 1)
        return 1;
    return n*factorial(n-1);
}

#include<iostream>
#include<cstring>
void feelTheBase(char *s, int n, int sys);
int main()
{
    using namespace std;
    char s[60];
    int n,sys;
    cout << "请输入一个整数:";
    cin >> n;
    cout << "请输入要转换的进制类型(2,8,16):";
    cin >> sys;
    feelTheBase(s, n, sys);
    cout << n << "转换成" << sys << "进制结果为: " << s <<endl;
    return 0;
}
void feelTheBase(char *s, int n, int sys)
{
    char bit[] = {"0123456789ABCDEF"};
    int len;
    if (n == 0)
    {
        strcpy(s, "");
        return;
    }
    feelTheBase(s, n/sys, sys);
    len = strlen(s);
    s[len] = bit[n%sys];
    s[len+1] = '\0';
}

<?php
function rec($dir, $lev=0){
    $dh = opendir($dir);
 while (($file = readdir($dh)) != false) {
  if ($file == '.' || $file == '..') {
   continue;
  }
  if (is_dir($dir.'/'.$file)){
      $arr = explode("/",$dir.'/'.$file);
   $lev = count($arr)-3;
      echo str_pad('',$lev, "--")."目录".$file."<br/>";
   rec($dir.'/'.$file, $lev+1);
  }else {
   echo str_pad('',$lev, "--").$file."<br/>";
     }
 }
 
 closedir($dh);
}
$dir = "./";
rec($dir);
?>

数据结构与算法之递归算法 C++和PHP实现

原文：http://blog.csdn.net/guugle2010/article/details/40855185