mirror of
https://github.com/ParkMoonJ/KaoYan.git
synced 2026-11-05 23:28:42 +08:00
Update 3 栈和队列.md
This commit is contained in:
@@ -372,11 +372,7 @@ int function(int n) {
|
||||
### 3.26 求解平方根 $\sqrt{A}$ 的迭代函数定义如下:
|
||||
|
||||
$$
|
||||
sqrt(A, p, e) =
|
||||
\begin{cases}
|
||||
p & |p^2 - A| < e \\
|
||||
sqrt(A, \frac{1}{2}(p + \frac{A}{p}), e) & |p^2 - A| \ge e
|
||||
\end{cases}
|
||||
sqrt(A, p, e) = \begin{cases} p & |p^2 - A| < e \\ sqrt(A, \frac{1}{2}(p + \frac{A}{p}), e) & |p^2 - A| \ge e \end{cases}
|
||||
$$
|
||||
|
||||
### 其中,$p$ 是 $A$ 的近似平方根,$e$ 是结果允许误差。试写出相应的递归算法,并消除递归。
|
||||
@@ -403,12 +399,7 @@ int function(int A, int p, int e) {
|
||||
### 3.27 已知 Ackerman 函数的定义如下:
|
||||
|
||||
$$
|
||||
akm(m, n) =
|
||||
\begin{cases}
|
||||
n + 1 & m = 0 \\
|
||||
akm(m - 1, 1) & m \ne 0,n = 0 \\
|
||||
akm(m - 1, akm(m, n - 1)) & m \ne 0,n \ne 0
|
||||
\end{cases}
|
||||
akm(m, n) = \begin{cases} n + 1 & m = 0 \\ akm(m - 1, 1) & m \ne 0,n = 0 \\ akm(m - 1, akm(m, n - 1)) & m \ne 0,n \ne 0 \end{cases}
|
||||
$$
|
||||
|
||||
#### (1)写出递归算法;
|
||||
|
||||
Reference in New Issue
Block a user