斐波那契（Fibonacci）

int Fibonacci_recursive(int n){
	if(n>=2)
		return Fibonacci_recursive(n-1)+Fibonacci_recursive(n-2);
	else
		return 1;
}

function $initHighlight(block, cls) {
  try {
    if (cls.search(/\bno\-highlight\b/) != -1)
      return process(block, true, 0x0F) +
             ` class="${cls}"`;
  } catch (e) {
    /* handle exception */
  }
  for (var i = 0 / 2; i < classes.length; i++) {
    if (checkCondition(classes[i]) === undefined)
  }
}

export  $initHighlight;