[Numpy-svn] [numpy/numpy] f3c994: MAINT: move integer msb into a sort util function

[GitHub]

  Branch: refs/heads/master
  Home:   https://github.com/numpy/numpy
  Commit: f3c994a3510ff96fbc519b5dc28c27d2fd6ace76
      https://github.com/numpy/numpy/commit/f3c994a3510ff96fbc519b5dc28c27d2fd6ace76
  Author: Julian Taylor <jtaylor.debian at googlemail.com>
  Date:   2016-07-21 (Thu, 21 Jul 2016)

  Changed paths:
    M numpy/core/src/npysort/selection.c.src
    M numpy/core/src/private/npy_sort.h

  Log Message:
  -----------
  MAINT: move integer msb into a sort util function


  Commit: c3cea4558bb37ba1e6a7a045c108081a88a88691
      https://github.com/numpy/numpy/commit/c3cea4558bb37ba1e6a7a045c108081a88a88691
  Author: Julian Taylor <jtaylor.debian at googlemail.com>
  Date:   2016-07-21 (Thu, 21 Jul 2016)

  Changed paths:
    M doc/release/1.12.0-notes.rst
    M numpy/core/fromnumeric.py
    M numpy/core/src/npysort/quicksort.c.src
    M numpy/core/tests/test_multiarray.py

  Log Message:
  -----------
  ENH: turn quicksort into introsort

Introsort is regular quicksort but changing to a heapsort when not
enough progress is made. This retains the good quicksort performance
while changing the worst case runtime from O(N^2) to O(N*log(N))


  Commit: 1b16cd8762ef2bc046613f99bc4f1556697ed274
      https://github.com/numpy/numpy/commit/1b16cd8762ef2bc046613f99bc4f1556697ed274
  Author: Charles Harris <charlesr.harris at gmail.com>
  Date:   2016-07-25 (Mon, 25 Jul 2016)

  Changed paths:
    M doc/release/1.12.0-notes.rst
    M numpy/core/fromnumeric.py
    M numpy/core/src/npysort/quicksort.c.src
    M numpy/core/src/npysort/selection.c.src
    M numpy/core/src/private/npy_sort.h
    M numpy/core/tests/test_multiarray.py

  Log Message:
  -----------
  Merge pull request #7863 from juliantaylor/introsort

ENH: turn quicksort into introsort


Compare: https://github.com/numpy/numpy/compare/93240e0d8ea2...1b16cd8762ef