It is much faster, but the sorting is very different from Windows file name sorting so they do different things. Speed-wise the old VI might be improved though, I have not looked into that.
NI also released their own slower (bubble sort based) example that does the same as mine did and there is a discussion on that page about this type of sorting:
I made a function a long time ago that sorted strings / file lists the way Windows do (https://forums.ni.com/t5/Example-Code/Alphabetical-and-Numerically-Logical-String-Array-Sort/ta-p/3996253) so when I saw you alphanumeric sorting algorithm I wanted to check if it gave the same output and if it was faster.
It is much faster, but the sorting is very different from Windows file name sorting so they do different things. Speed-wise the old VI might be improved though, I have not looked into that.
NI also released their own slower (bubble sort based) example that does the same as mine did and there is a discussion on that page about this type of sorting:
https://forums.ni.com/t5/Example-Code/AlphaLogical-Bubble-Sorting-Algorithm-in-LabVIEW/tac-p/4364948#M15428