diff options
author | wtli <liwt31@163.com> | 2019-01-30 10:34:40 +0800 |
---|---|---|
committer | wtli <liwt31@163.com> | 2019-01-30 10:34:40 +0800 |
commit | 317d13bf31798448588c670e6ce175f0abf15dff (patch) | |
tree | d8b0906794dd142b24737aa9fcbbd3aec4adaf17 /numpy/core/fromnumeric.py | |
parent | 5298b464f31bca533cbdb928916a7d5df49707c0 (diff) | |
download | numpy-317d13bf31798448588c670e6ce175f0abf15dff.tar.gz |
DOC: update docstring of timsort
Diffstat (limited to 'numpy/core/fromnumeric.py')
-rw-r--r-- | numpy/core/fromnumeric.py | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/numpy/core/fromnumeric.py b/numpy/core/fromnumeric.py index 7865dbf64..798a71395 100644 --- a/numpy/core/fromnumeric.py +++ b/numpy/core/fromnumeric.py @@ -895,13 +895,13 @@ def sort(a, axis=-1, kind='quicksort', order=None): worst case O(n*log(n)). 'stable' automatically choses the best stable sorting algorithm - for the data type being sorted. It is currently mapped to - merge sort. + for the data type being sorted. It is currently mapped to timsort. .. versionadded:: 1.17.0 Timsort is added for better performance on already or nearly sorted data. On random data timsort is almost identical to - mergesort. For details of timsort, refer 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 `CPython listsort.txt <https://github.com/python/cpython/blob/3.7/Objects/listsort.txt>`_. |