diff --git a/readme.md b/readme.md
index cc5174b..272499a 100644
--- a/readme.md
+++ b/readme.md
@@ -7,7 +7,7 @@ Let us know what other algorithms could use acceleration or improvement.
 
 Faster and Better Algorithms, starting with high performance sorting:
 - LSD Radix Sort for unsigned integer arrays. 20-30X faster than JavaScript's built-in array sort for arrays less than 35 Million.
-5-10X faster for arrays greater than 35 Million. This sort algorithm is not in-place.
+5-10X faster for arrays greater than 35 Million. This sort algorithm is not in-place, returning a new sorted array.
 Discussion, benchmarks and example in https://duvanenko.tech.blog/2017/06/15/faster-sorting-in-javascript/
 - LSD Radix Sort for arrays of user defined classes by an unsigned integer key. This is a stable sort,
 while JavaScript built-in is not stable.