Revisiting the Gold Hunt scenario
At this point, you should go back to Chapter 7, Performance – Identifying Bottlenecks, and refresh your memory on the Gold Hunt scenario. To summarize the problem, a circular field has gold coins scattered all over and you need to pick as many coins as you can while traveling across the field. However, you can only pick the coins lying inside the small search circles. We wrote an application code and discussed how tweaking the search_radius and field_coins (total scattered coins) parameters impact the performance. In the upcoming discussion, we will gradually improve the performance of this code.
Selecting a problem size
|
In order to
see a real difference in the timing after optimizing the code, let's increase the problem size further. In the previous chapter, The Great Dwarf wanted us to put one million coins on the field. Let's double the deal. Now, there are two million gold coins up for grabs! In short, |
