Merge pull request #318 from thomasaarholt/thomasaarholt-patch-1

Update Readme to emphasise when adaptive should be used

Author: basnijholt

README.rst

@@ -11,9 +11,12 @@
 ``adaptive`` is an open-source Python library designed to
 make adaptive parallel function evaluation simple. With ``adaptive`` you
 just supply a function with its bounds, and it will be evaluated at the
-“best” points in parameter space. With just a few lines of code you can
-evaluate functions on a computing cluster, live-plot the data as it
-returns, and fine-tune the adaptive sampling algorithm.
+“best” points in parameter space, rather than unecessarily computing *all* points on a dense grid.
+With just a few lines of code you can evaluate functions on a computing cluster,
+live-plot the data as it returns, and fine-tune the adaptive sampling algorithm.
+
+``adaptive`` shines on computations where each evaluation of the function
+takes *at least* ≈100ms due to the overhead of picking potentially interesting points.
 
 Run the ``adaptive`` example notebook `live on
 Binder <https://mybinder.org/v2/gh/python-adaptive/adaptive/master?filepath=example-notebook.ipynb>`_