diff options
author | wtli <liwt31@163.com> | 2019-01-21 21:46:44 +0800 |
---|---|---|
committer | wtli <liwt31@163.com> | 2019-01-21 22:17:28 +0800 |
commit | 5298b464f31bca533cbdb928916a7d5df49707c0 (patch) | |
tree | c2106f1812db6b4a8803c4292dd88a38e709cd52 /doc/release | |
parent | 918988bcaa04fb692af68324d87be3ede01bb1c7 (diff) | |
download | numpy-5298b464f31bca533cbdb928916a7d5df49707c0.tar.gz |
DOC: add docstring for timsort
Diffstat (limited to 'doc/release')
-rw-r--r-- | doc/release/1.17.0-notes.rst | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/doc/release/1.17.0-notes.rst b/doc/release/1.17.0-notes.rst index 4bdb812d7..f40b03a89 100644 --- a/doc/release/1.17.0-notes.rst +++ b/doc/release/1.17.0-notes.rst @@ -44,6 +44,14 @@ identity, it is necessary to also pass in an initial value (e.g., ``initial=np.inf`` for ``np.min``). For instance, the equivalent of ``nansum`` would be, ``np.sum(a, where=~np.isnan(a))``. +Timsort is added to available sorting algorithms +------------------------------------------------ +The ``kind`` keyword argument for ``sort`` and ``argsort`` now accepts ``'t'`` +or ``'timsort'`` for Timsort. Timsort features great performace +on already or nearly sorted data and basically changes to Mergesort on random data. +The algorithm is stable and requires O(n/2) additional space. +For details of the algorithm, refer to +`CPython listsort.txt <https://github.com/python/cpython/blob/3.7/Objects/listsort.txt>`_. ``np.linalg.svd`` and ``np.linalg.pinv`` can be faster on hermitian inputs -------------------------------------------------------------------------- |