--- a/SegmentedOrderedCollection.st	Fri Oct 14 00:28:38 2016 +0200
+++ b/SegmentedOrderedCollection.st	Fri Oct 14 00:38:23 2016 +0200
@@ -16,9 +16,13 @@
     SegmentedOrderedCollections are intended as a replacement for huge OrderedCollections or Lists.
     They keep their elements in chunks (segments), allowing for fast 
     adding/removing at either end AND relatively fast add/remove inside the collection.
-    For huge collections, the performance is much better when adding/removing inner elements.
+    Compared to regular orderedColletions, there is not much of a difference if
+    elements are added at either end.
+    However, when adding/removing inner elements, the performance of SegementedOrderedCollections
+    is much better above a certain number of elements (actually quite big).
 
-    However, notice: when only removing at either end only, an OrderedCollection is faster.
+    However, notice again: 
+        when only removing at either end only, an OrderedCollection is faster.
 
     The break-even in performance depends on the number of elements and the usage pattern.
     Consider it with (say) > 10000 elements and many adds/removes from the inside.