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 ... |
Get Learning Python Application Development now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
