递归模版： // Java public void recur(int level, int param) { // terminator if (level > MAX_LEVEL) { // process result return; }

// process current logic process(level, param);

// drill down recur( level: level + 1, newParam);

// restore current status } 分治模版（可以参考归并排序）： private static int divide_conquer(Problem problem) {

if (problem == NULL) { int res = process_last_result(); return res; } subProblems = split_problem(problem)

res0 = divide_conquer(subProblems[0]) res1 = divide_conquer(subProblems[1])

result = process_result(res0, res1);

return result; }