deletions | additions       diff --git a/Description of what the algorithm does.md b/Description of what the algorithm does.md  index 5a4eb7e..909c134 100644  --- a/Description of what the algorithm does.md  +++ b/Description of what the algorithm does.md 
...
The algorithm finds the sum of the first subsequence of numbers  that has the greatest non-negative sum in an array of numbers.    This may sound cryptic, so lets shed some light on it with an illustration.  If we have e.g. the sequence `[1, 2, 3, 4]` it will yield the sum 10,