Processing math: 100%
1 / 8
Settings
<<
<
>
>>
We will use expansion to guess the closed form solution for the recurrence
T
(
n
)
=
T
(
n
−
1
)
+
1
for
n
>
1
;
T
(
0
)
=
T
(
1
)
=
0
.
Created with Raphaël 2.1.2
Created with Raphaël 2.1.2
n
n-1
1 +
n-2
1 +
n-3
1 +
n-4
1 +
1
n
∑
i
=
1
1
Saving...
Server Error
Resubmit
