Update README.md

README.md

@@ -116,10 +116,11 @@ its specific structure.](https://www.jmlr.org/papers/volume18/14-467/14-467.pdf)
   version mainly for *theoretical* and/or *educational* interest, owing to its algorithmic
   simplicity (relative ease for mathematical analysis).
 
-Note that this above classification based on only the dimension of objective function is *just a
-very rough* estimation for **algorithm selection**. In practice, perhaps the **simplest** way to
-algorithm selection is **trial-and-error**. Otherwise, you can try more advanced [Automated
-Algorithm Selection](https://doi.org/10.1162/evco_a_00242) techniques.
+Note that this simple classification based on only the dimensionality of objective function
+is *just a very rough* estimation for **algorithm selection**. In practice, perhaps the
+**simplest** way to algorithm selection is **trial-and-error**. Otherwise, you can try
+more advanced [Automated Algorithm Selection](https://doi.org/10.1162/evco_a_00242)
+techniques.
 ******* *** ******* ******* *** ******* ******* *** ******* ******* *** *******
 
 Clearly, this is an **algorithm-centric** rather than benchmarking-centric Python library only