Sort 1D Array

[ouadji]

        the power of this function is limited, why ?

Be able to choose an ascending or descending sort.

          

[ouadji]

Build directly a descending sort is much faster than firstly make an ascending sort and then reverse it, especially with large arrays.

[elset191]

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.

[ouadji]

'reverse' doesn't cost mem or CPU  ... I didn't know that!

ok, duplicate  idea, thank you elset191.

[X.]

There is also this little guy from OpenG: