Here are a bunch of sort algorithms for LabVIEW. Included are:
They work with classes so they are a 'bit' generic. So for example you have a array of a certain class called A. Then you have to implement a "less then" comparator. Do not forget that the < operator you will create must be a strict total order, http://en.wikipedia.org/wiki/Total_order#Strict_total_order, otherwise you may see strange behavoir. You will then pass the less operator to the sort function as strict VI reference.
Examples are included in the example folder.
Explanation on a strict total order relation. A relation is called strict total order, with relation the "less then" operator is meant, if the following holds
Example code from the Example Code Exchange in the NI Community is licensed with the MIT license.
Possible to Convert these to LabView 2010 or older?