aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/README.md
diff options
context:
space:
mode:
authorEgor Tensin <Egor.Tensin@gmail.com>2016-04-17 23:32:44 +0300
committerEgor Tensin <Egor.Tensin@gmail.com>2016-04-17 23:32:44 +0300
commit185a9e4f00d9269a3711ada8ce5daf9de7a8173e (patch)
tree87d96beb0eab3e5f3ef739042bd3492c44a98e38 /README.md
parentmedian: quicksort instead of .sort() (diff)
downloadsorting-algorithms-185a9e4f00d9269a3711ada8ce5daf9de7a8173e.tar.gz
sorting-algorithms-185a9e4f00d9269a3711ada8ce5daf9de7a8173e.zip
refactoring + better plot captions
Diffstat (limited to 'README.md')
-rw-r--r--README.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/README.md b/README.md
index e277573..6c9613d 100644
--- a/README.md
+++ b/README.md
@@ -65,9 +65,9 @@ below.
**matplotlib** | 1.5.1 |
Each of the implemented algorithms was provided with three input sequences:
-* a list of *n* consecutive numbers sorted in ascending order ("sorted" input),
-* ... in descending order ("reversed" input),
-* ... in random order ("randomized" input).
+* a list of *n* consecutive numbers sorted in ascending order,
+* ... in descending order,
+* ... in random order.
You can generate the plots using `plot.py`.
Consult the output of `plot.py -h` to learn how to use the script.