the power of this function is limited, why ?
Be able to choose an ascending or descending sort.
Build directly a descending sort is much faster than firstly make an ascending sort and then reverse it, especially with large arrays.
http://forums.ni.com/t5/LabVIEW-Idea-Exchange/In-quot-Sort-1D-array-quot-node-uses-can-get-both-asce...
Also, see Aristos's first comment.
'reverse' doesn't cost mem or CPU ... I didn't know that!
ok, duplicate idea, thank you elset191.
There is also this little guy from OpenG:
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.
