summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCharles Harris <charlesr.harris@gmail.com>2006-01-01 23:24:08 +0000
committerCharles Harris <charlesr.harris@gmail.com>2006-01-01 23:24:08 +0000
commit912b8ef191e420c9b5f7bce9f52b6fa815bdae54 (patch)
tree54a6c7ac6b1e526c1ea4792e08a603c0cb92dd21
parentf169e88dee50378c8accfb7a67438271a73fcc61 (diff)
downloadpython-numpy-912b8ef191e420c9b5f7bce9f52b6fa815bdae54.tar.gz
python-numpy-912b8ef191e420c9b5f7bce9f52b6fa815bdae54.tar.bz2
python-numpy-912b8ef191e420c9b5f7bce9f52b6fa815bdae54.zip
Correct sort documentation
-rw-r--r--scipy/base/src/_sortmodule.c.src4
1 files changed, 2 insertions, 2 deletions
diff --git a/scipy/base/src/_sortmodule.c.src b/scipy/base/src/_sortmodule.c.src
index 35060eea7..ccf7a0f84 100644
--- a/scipy/base/src/_sortmodule.c.src
+++ b/scipy/base/src/_sortmodule.c.src
@@ -12,8 +12,8 @@
be slower than the merge and heap sorts. The merge sort requires
extra memory and so for large arrays may not be useful.
- Both the heap and merge sorts are *stable* meaning that equal components
- are unmoved from their entry versions and so can be used to
+ The merge sort is *stable*, meaning that equal components
+ are unmoved from their entry versions, so it can be used to
implement lexigraphic sorting on multiple keys.
*/