Java Reference
In-Depth Information
Print the data in the second node
dCB(firstNode)
Print the data in the first node
7.
O(
n
). You can use the same recurrence relation that was shown in Segments 7.22 and 7.23 for the method
countDown
.
8.
a.
t
(
n
)
=
1
+
t
(
n
-
1) for
n
>
0,
t
(0)
=
1.
b.
Since
t
(
n
)
=
n
+1, the algorithm is O(
n
).
9.
Move a disk from pole 1 to pole 2
Move a disk from pole 1 to pole 3
Move a disk from pole 2 to pole 3
Move a disk from pole 1 to pole 2
Move a disk from pole 3 to pole 1
Move a disk from pole 3 to pole 2
Move a disk from pole 1 to pole 2
Move a disk from pole 1 to pole 3
Move a disk from pole 2 to pole 3
Move a disk from pole 2 to pole 1
Move a disk from pole 3 to pole 1
Move a disk from pole 2 to pole 3
Move a disk from pole 1 to pole 2
Move a disk from pole 1 to pole 3
Move a disk from pole 2 to pole 3
10.
2 and 6, respectively.
11.
24 recursive calls and 12 additions.
12.
5 additions.