Added src/sorting/scaling.py to test sort algorithm scaling vs. N.

[parallel_computing.git] / src / sorting / README

diff --git a/src/sorting/README b/src/sorting/README
index e000dae3e67376c4b03668f9b75aea2c59cde0b5..d69b5d5bdf95e3829056e0dc234e8e4a4a7b785a 100644 (file)
--- a/src/sorting/README
+++ b/src/sorting/README
@@ -53,3 +53,11 @@ On ordered data bubble does much better
     $ time ./quicksort ordered-data > /dev/null
 
 quicksort takes 0.048 s and bubble takes 0.046 s.
+
+You can generate scaling graphs for all executables built by the
+Makefile with
+
+    $ make scaling
+
+which generates `*-scaling.dat` and `*-scaling.png` for each
+executable.