-- Nov 28 In-Class Exercise
Range of n: [0, 100]
Assuming uniform spacing is used,
For d=1, we would divide range into k=3 parts as:
[0, 50, 100]
We can expect that 0 would give better result than other two, since it is closer to the optimal value (21)
For d=2, we would explore the interval around 0. Since left part is out of range, we only consider the right part, and divide it into k=3 parts as:
[0 25 50]
We can expect that 25 would give better result than other two, since it is closer to the optimal value (21)
For d=3, we would explore the interval around 25, and divide it into k=3 parts as:
[13, 25, 37]
We can again expect that 25 would give better result than other two, since it is closer to the optimal value (21)
Since max depth is reached, search would be stopped. The predicted optimal value would be 25.
(
Edited: 2017-11-30)
<nowiki>Range of n: [0, 100]
Assuming uniform spacing is used,
For d=1, we would divide range into k=3 parts as:
[0, 50, 100]
We can expect that 0 would give better result than other two, since it is closer to the optimal value (21)
For d=2, we would explore the interval around 0. Since left part is out of range, we only consider the right part, and divide it into k=3 parts as:
[0 25 50]
We can expect that 25 would give better result than other two, since it is closer to the optimal value (21)
For d=3, we would explore the interval around 25, and divide it into k=3 parts as:
[13, 25, 37]
We can again expect that 25 would give better result than other two, since it is closer to the optimal value (21)
Since max depth is reached, search would be stopped. The predicted optimal value would be 25.</nowiki>