Doc, Here is an example using CombSort() (Fastest text sort algorithm until now) [Wink]

code:
Break On
Dim $aStr
$tempfile=("c:\temp\@WkSta.log")
If Open(1,$tempfile) = 0
$Line = ReadLine(1)
While @error = 0
If $aStr
$aStr = $aStr + '|'
EndIf
$aStr = $aStr + $Line
$Line = ReadLine(1)
Loop
$x=Close(1)
Else
Return
EndIf
$UnSortedArray = Split($aStr,'|')

$SortedArray = CombSort($UnSortedArray)

$tempfile2=("c:\temp\Inventory_@WkSta.log")
If Open(1,$tempfile2,5) = 0
For Each $Entry In $SortedArray
$x = WriteLine(1,$Entry + @CRLF)
Next
$x=Close(1)
EndIf

Return



;*************************************************************
;Just for the ease i have included Shawn's CombSort() UDF
;*************************************************************
Function CombSort($v, Optional $o)
Dim $i,$j,$m,$s,$g
$n=UBound($v)
$g = $n
If $g
While $g > 1 Or Not $s
$g=($g*1000)/1279
If $g < 1
$g = 1
EndIf
$s=1
For $i = 0 To $n-$g
$j=$i+$g
If ($v[$i] > $v[$j] And Not $o) Or ($v[$i] < $v[$j] And $o)
$m = $v[$i]
$v[$i] = $v[$j]
$v[$j] = $m
$s=0
EndIf
Next
Loop
$CombSort = $v
Else
$CombSort = 0
EndIf
EndFunction

For explanation of CombSort() look here: The combsort algorithm for kixtart arrays

[ 29. August 2002, 02:25: Message edited by: kholm ]