aboutsummaryrefslogtreecommitdiffstatshomepage
diff options
context:
space:
mode:
authorEgor Tensin <Egor.Tensin@gmail.com>2016-06-24 20:31:16 +0300
committerEgor Tensin <Egor.Tensin@gmail.com>2016-06-24 20:31:16 +0300
commit26dc7c186231ca96ae21b56d60bfdf567d8b17bb (patch)
tree7fcbcf25889dc5fdfcb184662f0205a50103050d
parentrename the project (diff)
downloadsorting-algorithms-26dc7c186231ca96ae21b56d60bfdf567d8b17bb.tar.gz
sorting-algorithms-26dc7c186231ca96ae21b56d60bfdf567d8b17bb.zip
plots: grammar tweaks
-rw-r--r--plots.html7
1 files changed, 3 insertions, 4 deletions
diff --git a/plots.html b/plots.html
index 2ee6a41..6f98cfd 100644
--- a/plots.html
+++ b/plots.html
@@ -119,8 +119,7 @@ implementations and b) studying the way algorithm's running time changes in
relation to the length of its input (a.k.a. identifying its time
complexity).</p>
<p class="text-muted">A simple way to visualize the way algorithm's running
-time changes would be to make appropriate measurements and plot them on a nice
-graph.
+time changes is to make appropriate measurements and plot them on a nice graph.
The results of course are highly dependent on the hardware used, while the
graph's look depends on the software used for rendering.</p>
<p class="text-muted">Both the hardware &amp; the software that were used
@@ -154,8 +153,8 @@ data generated using the code from the project repository's <code>master</code>
branch.
Visit <a href="https://github.com/egor-tensin/sorting-algorithms/">https://github.com/egor-tensin/sorting-algorithms/</a> for more details.</p>
- <p>In short, each of the implemented algorithms was provided with three
-input sequences:</p>
+ <p>Each of the implemented algorithms was provided with three input
+sequences:</p>
<ul>
<li>a list of <var>n</var> consecutive numbers sorted in ascending order,</li>
<li>&hellip; in descending order,</li>