summaryrefslogtreecommitdiff
path: root/numpy/core/fromnumeric.py
diff options
context:
space:
mode:
authorLars Buitinck <larsmans@gmail.com>2014-03-26 18:07:00 +0100
committerLars Buitinck <larsmans@gmail.com>2014-03-26 18:07:00 +0100
commite40c9616731852af7d13669c3a8197ed096d7853 (patch)
tree1338e87f8fc4aea82bde405b4897ae64143952f3 /numpy/core/fromnumeric.py
parentfc5d3750da073fcf0bcaf4654917e7338c76b2bd (diff)
downloadnumpy-e40c9616731852af7d13669c3a8197ed096d7853.tar.gz
DOC: partition doesn't have three algorithms (yet)
Diffstat (limited to 'numpy/core/fromnumeric.py')
-rw-r--r--numpy/core/fromnumeric.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/numpy/core/fromnumeric.py b/numpy/core/fromnumeric.py
index 728c95294..3de81305d 100644
--- a/numpy/core/fromnumeric.py
+++ b/numpy/core/fromnumeric.py
@@ -584,7 +584,7 @@ def partition(a, kth, axis=-1, kind='introselect', order=None):
The various selection algorithms are characterized by their average speed,
worst case performance, work space size, and whether they are stable. A
stable sort keeps items with the same key in the same relative order. The
- three available algorithms have the following properties:
+ available algorithms have the following properties:
================= ======= ============= ============ =======
kind speed worst case work space stable