[Octave-bug-tracker] [bug #53012] Performance of sort on complex values

[Rik]

Follow-up Comment #3, bug #53012 (project octave):

That seems right.  I was just counting blocks of memory, but being more
specific about the sizes of those blocks shows that the overhead is only 25%
(5/4).

One of the things to verify, or change, would be to make sure that internally
sortrows can form the index vector without also forming the sorted array.  If
the sorted array must always be generated then the overhead would be 75%
(7/4).

When using '~' in the interpreter to discard an output it is the function's
responsibility to check for that condition.  Some routines don't bother and
calculate every single output and then just let the interpreter silently
discard the unused ones.  That is not ideal, but many routines were coded
before the '~' feature was even available.

    _______________________________________________________

Reply to this item at:

  <http://savannah.gnu.org/bugs/?53012>

_______________________________________________
  Message sent via/by Savannah
  http://savannah.gnu.org/