DOC: minor rewording of partition note

1 files changed, 6 insertions, 5 deletions

diff --git a/doc/release/1.8.0-notes.rst b/doc/release/1.8.0-notes.rst
index d91e73e43..35fb175ef 100644
--- a/doc/release/1.8.0-notes.rst
+++ b/doc/release/1.8.0-notes.rst
@@ -189,12 +189,13 @@ complementary to the existing `zeros` and `zeros_like` functions.
 New functions `partition` and `argpartition`
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 
-New functions to partially sort arrays.
+New functions to partially sort arrays via a selection algorithm.
+
 Partial sorting moves the value of selected elements into their position if the
-array would be sorted via a selection algorithm. In the resulting array all
-elements smaller than the sorted elements will placed before the it and all
-equal or larger behind it.
-This has a time complexity of O(n) compared to O(n log(n)) of a full sort.
+array would be sorted. In the resulting array all elements smaller than the
+sorted elements will placed before the it and all equal or greater behind it.
+This has a linear time complexity of ``O(n)`` compared to ``O(n log(n))`` of a
+full sort.
 
 New functions `nanmean`, `nanvar` and `nanstd`
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~