Natural sort or Alphanumeric sort algorithm

Just use merge sort or insertion sort or whatever your favorite standard sorting algorithm.
The only extra thing you need to do is to write your own less than function. Just parse the string and if you see a number, count the digits first (or extract them, convert to integer and compare).

You can use QuickSort/InsertionSort (balanced combination) located in your mail db > form Group > action "Sort members list" calls > QuickSort in form's Globals

If you want to publish the code you can do that here and/or (even better) on openNTF.
I'm sure it'll be of good use to someone.

Here is the alphanumeri comparison code.  This can be used in any of the sorting methods such as quick sort , selection sort or any other.

This code can be inroduced at the point where the comparison is being done.

I could not access this site for couple of days, hence the delay.
Alphanum.txt

There are various scenarios for testing the complete functioning of alphanumeric sorts. My code works well in the scenarios which i have tested so far. It could fail in some unknown scenarios.