计算N!的递归算法如下，求解该算法的时间复杂度时，只考虑相乘操作，则算法的计算时间T(n)的递推关系式为(55)；对应时间复杂度为(56)。

 int Factorial (int n)

 {//计算n!

 if(n＜=1)return 1;

 else return n * Factorial(n-1);

 }

(62)

(80)

(81)

(78)

(79)

A Web browser is simply a terminal emulator, designed to display text on a screen. The two essential differences between an ordinary terminal emulator and a Web browser are that the browser knows how to deal with(71), and that it has a mechanism for(72)graphical files. Display text, display graphics, and(73)hyperlinks-there's 99 percent of the(74)value. That's not to say that the manufacturers didn't go all-out to attach a hyperactive efflorescence of useless capabilities onto their browsers. Remember when media channels in the browser were a big deal, instead of the clutter you can't wait to delete from your favorites of bookmarks menu? Remember when client-side Java applets were supposed to become the preferred(75)for application development? Remember frames and all their nasty side effects?

(77)

(76)

(73)

(75)

假设某程序语言的文法如下：

 S→a|b|(T)

 T→TdS|S

 其中，V_T={a，b，d，(，))；V_N={S，T}，S是开始符号。考察该文法，句型(Sd(T)db)是S的一个(28)。

 其中(29)是最左素短语，(30)是该句型的直接短语。

(74)

(72)