DOC: improve np.sort docstring (#13968)

* improve language around sorting

1 files changed, 13 insertions, 9 deletions

diff --git a/numpy/core/fromnumeric.py b/numpy/core/fromnumeric.py
index 08f17aae4..3389e7d66 100644
--- a/numpy/core/fromnumeric.py
+++ b/numpy/core/fromnumeric.py
@@ -908,14 +908,18 @@ def sort(a, axis=-1, kind=None, order=None):
 
     .. versionadded:: 1.12.0
 
-    quicksort has been changed to an introsort which will switch
-    heapsort when it does not make enough progress. This makes its
-    worst case O(n*log(n)).
-
-    'stable' automatically choses the best stable sorting algorithm
-    for the data type being sorted. It, along with 'mergesort' is
-    currently mapped to timsort or radix sort depending on the
-    data type. API forward compatibility currently limits the
+    quicksort has been changed to `introsort <https://en.wikipedia.org/wiki/Introsort>`_. 
+    When sorting does not make enough progress it switches to
+    `heapsort <https://en.wikipedia.org/wiki/Heapsort>`_. 
+    This implementation makes quicksort O(n*log(n)) in the worst case.
+
+    'stable' automatically chooses the best stable sorting algorithm
+    for the data type being sorted. 
+    It, along with 'mergesort' is currently mapped to 
+    `timsort <https://en.wikipedia.org/wiki/Timsort>`_ 
+    or `radix sort <https://en.wikipedia.org/wiki/Radix_sort>`_ 
+    depending on the data type. 
+    API forward compatibility currently limits the
     ability to select the implementation and it is hardwired for the different
     data types.
 
@@ -924,7 +928,7 @@ def sort(a, axis=-1, kind=None, order=None):
     Timsort is added for better performance on already or nearly
     sorted data. On random data timsort is almost identical to
     mergesort. It is now used for stable sort while quicksort is still the
-    default sort if none is chosen. For details of timsort, refer to
+    default sort if none is chosen. For timsort details, refer to
     `CPython listsort.txt <https://github.com/python/cpython/blob/3.7/Objects/listsort.txt>`_.
     'mergesort' and 'stable' are mapped to radix sort for integer data types. Radix sort is an
     O(n) sort instead of O(n log n).