How do I sort arrays using vbscript

Question

I m scanning through a file looking for lines that match a certain regex pattern  and then I want to print out the lines that match but in alphabetical order  I m sure this is trivial but vbscript isn t my background my array is defined as Dim lines 10000   if that makes any difference  and I m trying to execute my script from a normal cmd prompt

User · Answer

Here is a QuickSort that I wrote for the arrays returned from the GetRows method of ADODB Recordset    Author         Eric Weilnau  Date Written   7 16 2003  Description    QuickSortDataArray sorts a data array using the QuickSort algorithm                  Its arguments are the data array to be sorted  the low and high                 bound of the data array  the integer index of the column by which the                 data array should be sorted  and the string  asc  or  desc  for the                 sort order    Sub QuickSortDataArray dataArray  loBound  hiBound  sortField  sortOrder      Dim pivot    loSwap  hiSwap  count     ReDim pivot UBound dataArray        If hiBound - loBound   1 Then         If  sortOrder    asc  and dataArray sortField loBound   gt  dataArray sortField hiBound   or  sortOrder    desc  and dataArray sortField loBound   lt  dataArray sortField hiBound   Then             Call SwapDataRows dataArray  hiBound  loBound          End If     End If      For count   0 to UBound dataArray          pivot count    dataArray count int  loBound   hiBound    2           dataArray count int  loBound   hiBound    2     dataArray count loBound          dataArray count loBound    pivot count      Next      loSwap   loBound   1     hiSwap   hiBound      Do         Do While  sortOrder    asc  and dataArray sortField loSwap   lt   pivot sortField   or sortOrder    desc  and  dataArray sortField loSwap   gt   pivot sortField               loSwap   loSwap   1              If loSwap  gt  hiSwap Then                 Exit Do             End If         Loop          Do While  sortOrder    asc  and dataArray sortField hiSwap   gt  pivot sortField   or  sortOrder    desc  and dataArray sortField hiSwap   lt  pivot sortField               hiSwap   hiSwap - 1         Loop          If loSwap  lt  hiSwap Then             Call SwapDataRows dataArray loSwap hiSwap          End If     Loop While loSwap  lt  hiSwap      For count   0 to Ubound dataArray          dataArray count loBound    dataArray count hiSwap          dataArray count hiSwap    pivot count      Next      If loBound  lt   hiSwap - 1  Then         Call QuickSortDataArray dataArray  loBound  hiSwap-1  sortField  sortOrder      End If      If  hiSwap   1   lt  hiBound Then         Call QuickSortDataArray dataArray  hiSwap 1  hiBound  sortField  sortOrder      End If End Sub

User · Answer

From microsoft  Sorting arrays in VBScript has never been easy  that   s because VBScript doesn   t have a sort command of any kind  In turn  that always meant that VBScript scripters were forced to write their own sort routines  be that a bubble sort routine  a heap sort  a quicksort  or some other type of sorting algorithm   So  using  Net as it is installed on my pc    Set outputLines   CreateObject  System Collections ArrayList     add lines outputLines Add output outputLines Add output  outputLines Sort   For Each outputLine in outputLines     stdout WriteLine outputLine Next

User · Answer

From microsoft  Sorting arrays in VBScript has never been easy  that   s because VBScript doesn   t have a sort command of any kind  In turn  that always meant that VBScript scripters were forced to write their own sort routines  be that a bubble sort routine  a heap sort  a quicksort  or some other type of sorting algorithm   So  using  Net as it is installed on my pc    Set outputLines   CreateObject  System Collections ArrayList     add lines outputLines Add output outputLines Add output  outputLines Sort   For Each outputLine in outputLines     stdout WriteLine outputLine Next

User · Answer

Here is a QuickSort that I wrote for the arrays returned from the GetRows method of ADODB Recordset    Author         Eric Weilnau  Date Written   7 16 2003  Description    QuickSortDataArray sorts a data array using the QuickSort algorithm                  Its arguments are the data array to be sorted  the low and high                 bound of the data array  the integer index of the column by which the                 data array should be sorted  and the string  asc  or  desc  for the                 sort order    Sub QuickSortDataArray dataArray  loBound  hiBound  sortField  sortOrder      Dim pivot    loSwap  hiSwap  count     ReDim pivot UBound dataArray        If hiBound - loBound   1 Then         If  sortOrder    asc  and dataArray sortField loBound   gt  dataArray sortField hiBound   or  sortOrder    desc  and dataArray sortField loBound   lt  dataArray sortField hiBound   Then             Call SwapDataRows dataArray  hiBound  loBound          End If     End If      For count   0 to UBound dataArray          pivot count    dataArray count int  loBound   hiBound    2           dataArray count int  loBound   hiBound    2     dataArray count loBound          dataArray count loBound    pivot count      Next      loSwap   loBound   1     hiSwap   hiBound      Do         Do While  sortOrder    asc  and dataArray sortField loSwap   lt   pivot sortField   or sortOrder    desc  and  dataArray sortField loSwap   gt   pivot sortField               loSwap   loSwap   1              If loSwap  gt  hiSwap Then                 Exit Do             End If         Loop          Do While  sortOrder    asc  and dataArray sortField hiSwap   gt  pivot sortField   or  sortOrder    desc  and dataArray sortField hiSwap   lt  pivot sortField               hiSwap   hiSwap - 1         Loop          If loSwap  lt  hiSwap Then             Call SwapDataRows dataArray loSwap hiSwap          End If     Loop While loSwap  lt  hiSwap      For count   0 to Ubound dataArray          dataArray count loBound    dataArray count hiSwap          dataArray count hiSwap    pivot count      Next      If loBound  lt   hiSwap - 1  Then         Call QuickSortDataArray dataArray  loBound  hiSwap-1  sortField  sortOrder      End If      If  hiSwap   1   lt  hiBound Then         Call QuickSortDataArray dataArray  hiSwap 1  hiBound  sortField  sortOrder      End If End Sub

User · Answer

I know this is a pretty old topic but it might come in handy for anyone in the future  the script below does what the fella was trying to achieve purely using vbscript  when sorted terms starting in capital letters will have priority   for a   UBound ArrayOfTerms  - 1 To 0 Step -1     for j  0 to a         if ArrayOfTerms j  gt ArrayOfTerms j 1  then             temp ArrayOfTerms j 1              ArrayOfTerms j 1  ArrayOfTerms j              ArrayOfTerms j  temp         end if     next next

User · Answer

VBScript does not have a method for sorting arrays so you ve got two options    Writing a sorting function like mergesort  from ground up  Use the JScript tip from this article

User · Answer

Some old school array sorting   Of course this only sorts single dimension arrays    C  DropBox Automation Libraries Array vbs  Option Explicit  Public Function Array AdvancedBubbleSort ByRef rarr ArrayToSort    ByVal rstr SortOrder                                                                                             Date              12 09 1999     Author            Christopher J  Scharer  CJS      Description       Creates a sorted Array from a one dimensional array                         in Ascending  default  or Descending order based on the rstr SortOrder      Variables                             rarr ArrayToSort       The array to sort and return                      rstr SortOrder   The order to sort in  default ascending or D for descending                                                                                             Const const FUNCTION NAME    Array AdvancedBubbleSort      Dim bln Sorted     Dim lng Loop 01     Dim str SortOrder     Dim str Temp      bln Sorted   False     str SortOrder   Left UCase rstr SortOrder   1   We only need to know if the sort order is A SENC  or D ESEND    and for that matter we really only need to know if it s D because we are defaulting to Ascending      Do While  bln Sorted   False         bln Sorted   True         str Temp              If  str SortOrder    D   Then              Sort in descending order              For lng Loop 01   LBound rarr ArrayToSort  To  UBound rarr ArrayToSort  - 1                  If  rarr ArrayToSort lng Loop 01   lt  rarr ArrayToSort lng Loop 01   1   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort lng Loop 01                      rarr ArrayToSort lng Loop 01    rarr ArrayToSort lng Loop 01   1                      rarr ArrayToSort lng Loop 01   1    str Temp                 End If                 If  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1    gt  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1                       rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1     rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01                      rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01    str Temp                 End If             Next         Else              Default to Ascending              For lng Loop 01   LBound rarr ArrayToSort  To  UBound rarr ArrayToSort  - 1                  If  rarr ArrayToSort lng Loop 01   gt  rarr ArrayToSort lng Loop 01   1   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort lng Loop 01                      rarr ArrayToSort lng Loop 01    rarr ArrayToSort lng Loop 01   1                      rarr ArrayToSort lng Loop 01   1    str Temp                 End If                 If  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1    lt  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1                       rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1     rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01                      rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01    str Temp                 End If             Next         End If     Loop End Function  Public Function Array BubbleSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array BubbleSort      Dim lng Loop 01     Dim lng Loop 02     Dim var Temp      For lng Loop 01    UBound rarr ArrayToSort  - 1  To 0 Step -1         For lng Loop 02   0 To lng Loop 01             If rarr ArrayToSort lng Loop 02   gt  rarr ArrayToSort lng Loop 02   1  Then                 var Temp   rarr ArrayToSort lng Loop 02   1                  rarr ArrayToSort lng Loop 02   1    rarr ArrayToSort lng Loop 02                  rarr ArrayToSort lng Loop 02    var Temp             End If         Next     Next End Function  Public Function Array GetDimensions ByVal rarr Array      Const const FUNCTION NAME    Array GetDimensions      Dim int Dimensions     Dim int Result     Dim str Dimensions      int Result   0     If IsArray rarr Array  Then         On Error Resume Next         Do             int Dimensions   -2             int Dimensions   UBound rarr Array  int Result   1              If int Dimensions  gt  -2 Then                 int Result   int Result   1                 If int Result   1 Then                     str Dimensions   str Dimensions  amp  int Dimensions                 Else                     str Dimensions   str Dimensions  amp       amp  int Dimensions                 End If             End If         Loop Until int Dimensions   -2         On Error GoTo 0     End If     Array GetDimensions   int Result    amp       amp  str Dimensions End Function  Public Function Array GetUniqueCombinations ByVal rarr Fields  ByRef robj Combinations      Const const FUNCTION NAME    Array GetUniqueCombinations      Dim int Element     Dim str Combination      On Error Resume Next      Array GetUniqueCombinations   CBool False      For int Element   LBound rarr Fields  To UBound rarr Fields          str Combination   rarr Fields int Element          Call robj Combinations Add robj Combinations Count  amp       amp  str Combination  0           Call Array GetUniqueCombinationsSub rarr Fields  robj Combinations  int Element      Next  int Element     For int Element   LBound rarr Fields  To UBound rarr Fields          Call Array GetUniqueCombinationsSub rarr Fields  robj Combinations  int Element      Next  int Element     Array GetUniqueCombinations   CBool True  End Function  Array GetUniqueCombinations  Public Function Array GetUniqueCombinationsSub ByVal rarr Fields  ByRef robj Combinations  ByRef rint LBound      Const const FUNCTION NAME    Array GetUniqueCombinationsSub      Dim int Element     Dim str Combination      On Error Resume Next      Array GetUniqueCombinationsSub   CBool False      str Combination   rarr Fields rint LBound      For int Element    rint LBound   1  To UBound rarr Fields          str Combination   str Combination  amp       amp  rarr Fields int Element          Call robj Combinations Add robj Combinations Count  amp       amp  str Combination  str Combination      Next  int Element     Array GetUniqueCombinationsSub   CBool True  End Function  Array GetUniqueCombinationsSub  Public Function Array HeapSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array HeapSort      Dim lng Loop 01     Dim var Temp     Dim arr Size      arr Size   UBound rarr ArrayToSort    1     For lng Loop 01     arr Size   2  - 1  To 0 Step -1         Call Array SiftDown rarr ArrayToSort  lng Loop 01  arr Size      Next     For lng Loop 01    arr Size - 1  To 1 Step -1         var Temp   rarr ArrayToSort 0          rarr ArrayToSort 0    rarr ArrayToSort lng Loop 01          rarr ArrayToSort lng Loop 01    var Temp         Call Array SiftDown rarr ArrayToSort  0   lng Loop 01 - 1       Next End Function  Public Function Array InsertionSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array InsertionSort      Dim lng ElementCount     Dim lng Loop 01     Dim lng Loop 02     Dim lng Index      lng ElementCount   UBound rarr ArrayToSort    1     For lng Loop 01   1 To  lng ElementCount - 1          lng Index   rarr ArrayToSort lng Loop 01          lng Loop 02   lng Loop 01         Do While lng Loop 02  gt  0             If rarr ArrayToSort lng Loop 02 - 1   gt  lng Index Then                 rarr ArrayToSort lng Loop 02    rarr ArrayToSort lng Loop 02 - 1                  lng Loop 02    lng Loop 02 - 1              End If         Loop         rarr ArrayToSort lng Loop 02    lng Index     Next End Function  Private Function Array Merge ByRef rarr ArrayToSort    ByRef rarr ArrayTemp    ByVal rlng Left  ByVal rlng MiddleIndex  ByVal rlng Right                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Merges an array                                                                                             Const const FUNCTION NAME    Array Merge      Dim lng Loop 01     Dim lng LeftEnd     Dim lng ElementCount     Dim lng TempPos      lng LeftEnd    rlng MiddleIndex - 1      lng TempPos   rlng Left     lng ElementCount    rlng Right - rlng Left   1      Do While  rlng Left  lt   lng LeftEnd        And  rlng MiddleIndex  lt   rlng Right          If rarr ArrayToSort rlng Left   lt   rarr ArrayToSort rlng MiddleIndex  Then             rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng Left              lng TempPos    lng TempPos   1              rlng Left    rlng Left   1          Else             rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng MiddleIndex              lng TempPos    lng TempPos   1              rlng MiddleIndex    rlng MiddleIndex   1          End If     Loop     Do While rlng Left  lt   lng LeftEnd         rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng Left          rlng Left    rlng Left   1          lng TempPos    lng TempPos   1      Loop     Do While rlng MiddleIndex  lt   rlng Right         rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng MiddleIndex          rlng MiddleIndex    rlng MiddleIndex   1          lng TempPos    lng TempPos   1      Loop     For lng Loop 01   0 To  lng ElementCount - 1          rarr ArrayToSort rlng Right    rarr ArrayTemp rlng Right          rlng Right    rlng Right - 1      Next End Function  Public Function Array MergeSort ByRef rarr ArrayToSort    ByRef rarr ArrayTemp    ByVal rlng FirstIndex  ByVal rlng LastIndex                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array      Note             The rarr ArrayTemp array that is passed in has to be dimensionalized to the same size                             as the rarr ArrayToSort array that is passed in prior to calling the function                              Also the rlng FirstIndex variable should be the value of the LBound rarr ArrayToSort                              and the rlng LastIndex variable should be the value of the UBound rarr ArrayToSort                                                                                             Const const FUNCTION NAME    Array MergeSort      Dim lng MiddleIndex      If rlng LastIndex  gt  rlng FirstIndex Then           Recursively sort the two halves of the list          lng MiddleIndex     rlng FirstIndex   rlng LastIndex    2          Call Array MergeSort rarr ArrayToSort  rarr ArrayTemp  rlng FirstIndex  lng MiddleIndex          Call Array MergeSort rarr ArrayToSort  rarr ArrayTemp  lng MiddleIndex   1  rlng LastIndex             Merge the results          Call Array Merge rarr ArrayToSort  rarr ArrayTemp  rlng FirstIndex  lng MiddleIndex   1  rlng LastIndex      End If End Function  Public Function Array Push ByRef rarr Array  ByVal rstr Value  ByVal rstr Delimiter      Const const FUNCTION NAME    Array Push      Dim int Loop     Dim str Array 01     Dim str Array 02       If there is no delimiter passed in then set the default delimiter equal to a comma      If rstr Delimiter      Then         rstr Delimiter           End If       Check to see if the rarr Array is actually an Array      If IsArray rarr Array    True Then          Verify that the rarr Array variable is only a one dimensional array          If Array GetDimensions rarr Array   lt  gt  1 Then             Array Push    ERR  the rarr Array variable passed in was not a one dimensional array               Exit Function         End If         If IsArray rstr Value    True Then              Verify that the rstr Value variable is is only a one dimensional array              If Array GetDimensions rstr Value   lt  gt  1 Then                 Array Push    ERR  the rstr Value variable passed in was not a one dimensional array                   Exit Function             End If             str Array 01   Split rarr Array  rstr Delimiter              str Array 02   Split rstr Value  rstr Delimiter              rarr Array   Join str Array 01  amp  rstr Delimiter  amp  str Array 02          Else             On Error Resume Next             ReDim Preserve rarr Array UBound rarr Array    1              If Err Number  lt  gt  0 Then    Subscript out of range   An array that was passed in must have been Erased to re-create it with new elements  possibly when passing an array to be populated into a recursive function                  ReDim rarr Array 0                  Err Clear             End If             If IsObject rstr Value    True Then                 Set rarr Array UBound rarr Array     rstr Value             Else                 rarr Array UBound rarr Array     rstr Value             End If         End If     Else          Check to see if the rstr Value is an Array          If IsArray rstr Value    True Then              Verify that the rstr Value variable is is only a one dimensional array              If Array GetDimensions rstr Value   lt  gt  1 Then                 Array Push    ERR  the rstr Value variable passed in was not a one dimensional array                   Exit Function             End If             rarr Array   rstr Value         Else             rarr Array   Split rstr Value  rstr Delimiter          End If     End If     Array Push   UBound rarr Array  End Function  Public Function Array QuickSort ByRef rarr ArrayToSort    ByVal rlng Low  ByVal rlng High                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array      Note             The rlng Low variable should be the value of the LBound rarr ArrayToSort                              and the rlng High variable should be the value of the UBound rarr ArrayToSort                                                                                             Const const FUNCTION NAME    Array QuickSort      Dim var Pivot     Dim lng Swap     Dim lng Low     Dim lng High      lng Low   rlng Low     lng High   rlng High     var Pivot   rarr ArrayToSort  rlng Low   rlng High    2      Do While lng Low  lt   lng High         Do While  rarr ArrayToSort lng Low   lt  var Pivot           And lng Low  lt  rlng High              lng Low   lng Low   1         Loop         Do While  var Pivot  lt  rarr ArrayToSort lng High            And lng High  gt  rlng Low              lng High    lng High - 1          Loop         If lng Low  lt   lng High Then             lng Swap   rarr ArrayToSort lng Low              rarr ArrayToSort lng Low    rarr ArrayToSort lng High              rarr ArrayToSort lng High    lng Swap             lng Low    lng Low   1              lng High    lng High - 1          End If     Loop     If rlng Low  lt  lng High Then         Call Array QuickSort rarr ArrayToSort  rlng Low  lng High      End If     If lng Low  lt  rlng High Then         Call Array QuickSort rarr ArrayToSort  lng Low  rlng High      End If End Function  Public Function Array SelectionSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array SelectionSort      Dim lng ElementCount     Dim lng Loop 01     Dim lng Loop 02     Dim lng Min     Dim var Temp      lng ElementCount   UBound rarr ArrayToSort    1     For lng Loop 01   0 To  lng ElementCount - 2          lng Min   lng Loop 01         For lng Loop 02    lng Loop 01   1  To lng ElementCount - 1             If rarr ArrayToSort lng Loop 02   lt  rarr ArrayToSort lng Min  Then             lng Min   lng Loop 02             End If         Next         var Temp   rarr ArrayToSort lng Loop 01          rarr ArrayToSort lng Loop 01    rarr ArrayToSort lng Min          rarr ArrayToSort lng Min    var Temp     Next End Function  Public Function Array ShellSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array ShellSort      Dim lng Loop 01     Dim var Temp     Dim lng Hold     Dim lng HValue      lng HValue   LBound rarr ArrayToSort      Do         lng HValue    3   lng HValue   1      Loop Until lng HValue  gt  UBound rarr ArrayToSort      Do         lng HValue    lng HValue   3          For lng Loop 01    lng HValue   LBound rarr ArrayToSort   To UBound rarr ArrayToSort              var Temp   rarr ArrayToSort lng Loop 01              lng Hold   lng Loop 01             Do While rarr ArrayToSort lng Hold - lng HValue   gt  var Temp                 rarr ArrayToSort lng Hold    rarr ArrayToSort lng Hold - lng HValue                  lng Hold    lng Hold - lng HValue                  If lng Hold  lt  lng HValue Then                     Exit Do                 End If             Loop             rarr ArrayToSort lng Hold    var Temp         Next     Loop Until lng HValue   LBound rarr ArrayToSort  End Function  Private Function Array SiftDown ByRef rarr ArrayToSort    ByVal rlng Root  ByVal rlng Bottom                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sifts the elements down in an array                                                                                             Const const FUNCTION NAME    Array SiftDown      Dim bln Done     Dim max Child     Dim var Temp      bln Done   False     Do While   rlng Root   2   lt   rlng Bottom        And bln Done   False         If rlng Root   2   rlng Bottom Then             max Child    rlng Root   2          ElseIf rarr ArrayToSort rlng Root   2   gt  rarr ArrayToSort rlng Root   2   1  Then             max Child    rlng Root   2          Else             max Child    rlng Root   2   1          End If         If rarr ArrayToSort rlng Root   lt  rarr ArrayToSort max Child  Then             var Temp   rarr ArrayToSort rlng Root              rarr ArrayToSort rlng Root    rarr ArrayToSort max Child              rarr ArrayToSort max Child    var Temp             rlng Root   max Child         Else             bln Done   True         End If     Loop End Function

User · Answer

Disconnected recordsets can be useful   Const adVarChar   200   the SQL datatype is varchar   Create a disconnected recordset Set rs   CreateObject  ADODB RECORDSET   rs Fields append  SortField   adVarChar  25  rs CursorType   adOpenStatic rs Open rs AddNew  SortField    Some data  rs Update rs AddNew  SortField    All data  rs Update  rs Sort    SortField   rs MoveFirst  Do Until rs EOF     strList strList  amp  vbCrLf  amp  rs Fields  SortField               rs MoveNext Loop   MsgBox strList

User · Answer

You either have to write your own sort by hand  or maybe try this technique     http   www aspfaqs com aspfaqs ShowFAQ asp FAQID 83  You can freely intermix server side javascript with VBScript  so wherever VBScript falls short  switch to javascript

User · Answer

I actually just had to do something similar but with a 2D array yesterday  I am not that up to speed on vbscript and this process really bogged me down  I found that the articles here were very well written and got me on the road to sorting in vbscript

User · Answer

I know this is a pretty old topic but it might come in handy for anyone in the future  the script below does what the fella was trying to achieve purely using vbscript  when sorted terms starting in capital letters will have priority   for a   UBound ArrayOfTerms  - 1 To 0 Step -1     for j  0 to a         if ArrayOfTerms j  gt ArrayOfTerms j 1  then             temp ArrayOfTerms j 1              ArrayOfTerms j 1  ArrayOfTerms j              ArrayOfTerms j  temp         end if     next next

User · Answer

VBScript does not have a method for sorting arrays so you ve got two options    Writing a sorting function like mergesort  from ground up  Use the JScript tip from this article

User · Answer

I actually just had to do something similar but with a 2D array yesterday  I am not that up to speed on vbscript and this process really bogged me down  I found that the articles here were very well written and got me on the road to sorting in vbscript

User · Answer

You either have to write your own sort by hand  or maybe try this technique     http   www aspfaqs com aspfaqs ShowFAQ asp FAQID 83  You can freely intermix server side javascript with VBScript  so wherever VBScript falls short  switch to javascript

User · Answer

This is a vbscript implementation of merge sort         Function Name  Sort   Author  Lewis Gordon   Creation Date  4 26 12   Description  Sorts a given array either in ascending or descending order  as specified by the                  order parameter   This array is then returned at the end of the function    Prerequisites   An array must be allocated and have all its values inputted    Parameters        ArrayToSort   This is the array that is being sorted        Order   This is the sorting order that the array will be sorted in   This parameter                   can either    be  ASC  or  DESC  or ascending and descending  respectively    Notes   This uses merge sort under the hood   Also  this function has only been tested for              integers and strings in the array   However  this should work for any data type that              implements the greater than and less than comparators   This function also requires              that the merge function is also present  as it is needed to complete the sort    Examples       Dim i      Dim TestArray 50       Randomize      For i 0 to UBound TestArray           TestArray i    Int  100 - 0   1    Rnd   0       Next      MsgBox Join Sort TestArray   DESC        Return value   This function returns a sorted array in the specified order    Change History  None   The merge function  Public Function Merge LeftArray  RightArray  Order       Declared variables     Dim FinalArray     Dim FinalArraySize     Dim i     Dim LArrayPosition     Dim RArrayPosition       Variable initialization     LArrayPosition   0     RArrayPosition   0       Calculate the expected size of the array based on the two smaller arrays      FinalArraySize   UBound LeftArray    UBound RightArray    1     ReDim FinalArray FinalArraySize        This should go until we need to exit the function      While True           If we are done with all the values in the left array   Add the rest of the right array          to the final array          If LArrayPosition  gt   UBound LeftArray  1 Then             For i RArrayPosition To UBound RightArray                  FinalArray LArrayPosition i    RightArray i              Next             Merge   FinalArray             Exit Function           If we are done with all the values in the right array   Add the rest of the left array          to the final array          ElseIf RArrayPosition  gt   UBound RightArray  1 Then             For i LArrayPosition To UBound LeftArray                  FinalArray i RArrayPosition    LeftArray i              Next             Merge   FinalArray             Exit Function           For descending  if the current value of the left array is greater than the right array           then add it to the final array   The position of the left array will then be incremented          by one          ElseIf LeftArray LArrayPosition   gt  RightArray RArrayPosition  And UCase Order     DESC  Then             FinalArray LArrayPosition RArrayPosition    LeftArray LArrayPosition              LArrayPosition   LArrayPosition   1           For ascending  if the current value of the left array is less than the right array           then add it to the final array   The position of the left array will then be incremented          by one          ElseIf LeftArray LArrayPosition   lt  RightArray RArrayPosition  And UCase Order     ASC  Then             FinalArray LArrayPosition RArrayPosition    LeftArray LArrayPosition              LArrayPosition   LArrayPosition   1           For anything else that wasn t covered  add the current value of the right array to the          final array          Else             FinalArray LArrayPosition RArrayPosition    RightArray RArrayPosition              RArrayPosition   RArrayPosition   1         End If     Wend End Function   The main sort function  Public Function Sort ArrayToSort  Order       Variable declaration      Dim i     Dim LeftArray     Dim Modifier     Dim RightArray       Check to make sure the order parameter is okay      If Not UCase Order   ASC  And Not UCase Order   DESC  Then         Exit Function     End If      If the array is a singleton or 0 then it is sorted      If UBound ArrayToSort   lt   0 Then         Sort   ArrayToSort         Exit Function     End If       Setting up the modifier to help us split the array effectively since the round      functions aren t helpful in VBScript      If UBound ArrayToSort  Mod 2   0 Then         Modifier   1     Else         Modifier   0     End If       Setup the arrays to about half the size of the main array      ReDim LeftArray Fix UBound ArrayToSort  2       ReDim RightArray Fix UBound ArrayToSort  2 -Modifier        Add the first half of the values to one array      For i 0 To UBound LeftArray          LeftArray i    ArrayToSort i      Next       Add the other half of the values to the other array      For i 0 To UBound RightArray          RightArray i    ArrayToSort i Fix UBound ArrayToSort  2  1      Next       Merge the sorted arrays      Sort   Merge Sort LeftArray  Order   Sort RightArray  Order   Order  End Function

User · Answer

If you are going to output the lines anyway  you could run the output through the sort command  Not elegant  but it does not require much work   cscript exe   nologo YOUR-SCRIPT   Sort   Note   nologo omits the logo lines  Microsoft  R  Windows Script Host Version    blah blah blah  from appearing in the middle of your sorted output   I guess MS does not know what stderr is for    See http   ss64 com nt sort html for details on sort     n is the most useful option if your sort key does not start in the first column   Compares are always case-insensitive  which is lame

User · Answer

I actually just had to do something similar but with a 2D array yesterday  I am not that up to speed on vbscript and this process really bogged me down  I found that the articles here were very well written and got me on the road to sorting in vbscript

User · Answer

Disconnected recordsets can be useful   Const adVarChar   200   the SQL datatype is varchar   Create a disconnected recordset Set rs   CreateObject  ADODB RECORDSET   rs Fields append  SortField   adVarChar  25  rs CursorType   adOpenStatic rs Open rs AddNew  SortField    Some data  rs Update rs AddNew  SortField    All data  rs Update  rs Sort    SortField   rs MoveFirst  Do Until rs EOF     strList strList  amp  vbCrLf  amp  rs Fields  SortField               rs MoveNext Loop   MsgBox strList

User · Answer

When having large   wide   arrays  instead of moving each element of a long row of data around  use a one-dimensional array with indexes of the array   initialize ptr arr with 0 1 2 3   uBound arr  then access data with   arr field index ptr arr row index     instead of  arr field index row index    and just swap the elements of ptr arr instead of swapping the rows   If you are processing the array row by row  eg displaying it as a   you can take the lookout out of the inner loop   max col uBound arr 1  response write   lt table gt   for n   0 to uBound arr 2    response write   lt tr gt     row ptr arr n    for i 0 to max col     response write   lt td gt   amp arr i row  amp   lt  td gt     next   response write   lt  tr gt  next response write   lt  table gt

User · Answer

If you are going to output the lines anyway  you could run the output through the sort command  Not elegant  but it does not require much work   cscript exe   nologo YOUR-SCRIPT   Sort   Note   nologo omits the logo lines  Microsoft  R  Windows Script Host Version    blah blah blah  from appearing in the middle of your sorted output   I guess MS does not know what stderr is for    See http   ss64 com nt sort html for details on sort     n is the most useful option if your sort key does not start in the first column   Compares are always case-insensitive  which is lame

User · Answer

I actually just had to do something similar but with a 2D array yesterday  I am not that up to speed on vbscript and this process really bogged me down  I found that the articles here were very well written and got me on the road to sorting in vbscript

User · Answer

When having large   wide   arrays  instead of moving each element of a long row of data around  use a one-dimensional array with indexes of the array   initialize ptr arr with 0 1 2 3   uBound arr  then access data with   arr field index ptr arr row index     instead of  arr field index row index    and just swap the elements of ptr arr instead of swapping the rows   If you are processing the array row by row  eg displaying it as a   you can take the lookout out of the inner loop   max col uBound arr 1  response write   lt table gt   for n   0 to uBound arr 2    response write   lt tr gt     row ptr arr n    for i 0 to max col     response write   lt td gt   amp arr i row  amp   lt  td gt     next   response write   lt  tr gt  next response write   lt  table gt

User · Answer

Here is a QuickSort that I wrote for the arrays returned from the GetRows method of ADODB Recordset    Author         Eric Weilnau  Date Written   7 16 2003  Description    QuickSortDataArray sorts a data array using the QuickSort algorithm                  Its arguments are the data array to be sorted  the low and high                 bound of the data array  the integer index of the column by which the                 data array should be sorted  and the string  asc  or  desc  for the                 sort order    Sub QuickSortDataArray dataArray  loBound  hiBound  sortField  sortOrder      Dim pivot    loSwap  hiSwap  count     ReDim pivot UBound dataArray        If hiBound - loBound   1 Then         If  sortOrder    asc  and dataArray sortField loBound   gt  dataArray sortField hiBound   or  sortOrder    desc  and dataArray sortField loBound   lt  dataArray sortField hiBound   Then             Call SwapDataRows dataArray  hiBound  loBound          End If     End If      For count   0 to UBound dataArray          pivot count    dataArray count int  loBound   hiBound    2           dataArray count int  loBound   hiBound    2     dataArray count loBound          dataArray count loBound    pivot count      Next      loSwap   loBound   1     hiSwap   hiBound      Do         Do While  sortOrder    asc  and dataArray sortField loSwap   lt   pivot sortField   or sortOrder    desc  and  dataArray sortField loSwap   gt   pivot sortField               loSwap   loSwap   1              If loSwap  gt  hiSwap Then                 Exit Do             End If         Loop          Do While  sortOrder    asc  and dataArray sortField hiSwap   gt  pivot sortField   or  sortOrder    desc  and dataArray sortField hiSwap   lt  pivot sortField               hiSwap   hiSwap - 1         Loop          If loSwap  lt  hiSwap Then             Call SwapDataRows dataArray loSwap hiSwap          End If     Loop While loSwap  lt  hiSwap      For count   0 to Ubound dataArray          dataArray count loBound    dataArray count hiSwap          dataArray count hiSwap    pivot count      Next      If loBound  lt   hiSwap - 1  Then         Call QuickSortDataArray dataArray  loBound  hiSwap-1  sortField  sortOrder      End If      If  hiSwap   1   lt  hiBound Then         Call QuickSortDataArray dataArray  hiSwap 1  hiBound  sortField  sortOrder      End If End Sub

User · Answer

This is a vbscript implementation of merge sort         Function Name  Sort   Author  Lewis Gordon   Creation Date  4 26 12   Description  Sorts a given array either in ascending or descending order  as specified by the                  order parameter   This array is then returned at the end of the function    Prerequisites   An array must be allocated and have all its values inputted    Parameters        ArrayToSort   This is the array that is being sorted        Order   This is the sorting order that the array will be sorted in   This parameter                   can either    be  ASC  or  DESC  or ascending and descending  respectively    Notes   This uses merge sort under the hood   Also  this function has only been tested for              integers and strings in the array   However  this should work for any data type that              implements the greater than and less than comparators   This function also requires              that the merge function is also present  as it is needed to complete the sort    Examples       Dim i      Dim TestArray 50       Randomize      For i 0 to UBound TestArray           TestArray i    Int  100 - 0   1    Rnd   0       Next      MsgBox Join Sort TestArray   DESC        Return value   This function returns a sorted array in the specified order    Change History  None   The merge function  Public Function Merge LeftArray  RightArray  Order       Declared variables     Dim FinalArray     Dim FinalArraySize     Dim i     Dim LArrayPosition     Dim RArrayPosition       Variable initialization     LArrayPosition   0     RArrayPosition   0       Calculate the expected size of the array based on the two smaller arrays      FinalArraySize   UBound LeftArray    UBound RightArray    1     ReDim FinalArray FinalArraySize        This should go until we need to exit the function      While True           If we are done with all the values in the left array   Add the rest of the right array          to the final array          If LArrayPosition  gt   UBound LeftArray  1 Then             For i RArrayPosition To UBound RightArray                  FinalArray LArrayPosition i    RightArray i              Next             Merge   FinalArray             Exit Function           If we are done with all the values in the right array   Add the rest of the left array          to the final array          ElseIf RArrayPosition  gt   UBound RightArray  1 Then             For i LArrayPosition To UBound LeftArray                  FinalArray i RArrayPosition    LeftArray i              Next             Merge   FinalArray             Exit Function           For descending  if the current value of the left array is greater than the right array           then add it to the final array   The position of the left array will then be incremented          by one          ElseIf LeftArray LArrayPosition   gt  RightArray RArrayPosition  And UCase Order     DESC  Then             FinalArray LArrayPosition RArrayPosition    LeftArray LArrayPosition              LArrayPosition   LArrayPosition   1           For ascending  if the current value of the left array is less than the right array           then add it to the final array   The position of the left array will then be incremented          by one          ElseIf LeftArray LArrayPosition   lt  RightArray RArrayPosition  And UCase Order     ASC  Then             FinalArray LArrayPosition RArrayPosition    LeftArray LArrayPosition              LArrayPosition   LArrayPosition   1           For anything else that wasn t covered  add the current value of the right array to the          final array          Else             FinalArray LArrayPosition RArrayPosition    RightArray RArrayPosition              RArrayPosition   RArrayPosition   1         End If     Wend End Function   The main sort function  Public Function Sort ArrayToSort  Order       Variable declaration      Dim i     Dim LeftArray     Dim Modifier     Dim RightArray       Check to make sure the order parameter is okay      If Not UCase Order   ASC  And Not UCase Order   DESC  Then         Exit Function     End If      If the array is a singleton or 0 then it is sorted      If UBound ArrayToSort   lt   0 Then         Sort   ArrayToSort         Exit Function     End If       Setting up the modifier to help us split the array effectively since the round      functions aren t helpful in VBScript      If UBound ArrayToSort  Mod 2   0 Then         Modifier   1     Else         Modifier   0     End If       Setup the arrays to about half the size of the main array      ReDim LeftArray Fix UBound ArrayToSort  2       ReDim RightArray Fix UBound ArrayToSort  2 -Modifier        Add the first half of the values to one array      For i 0 To UBound LeftArray          LeftArray i    ArrayToSort i      Next       Add the other half of the values to the other array      For i 0 To UBound RightArray          RightArray i    ArrayToSort i Fix UBound ArrayToSort  2  1      Next       Merge the sorted arrays      Sort   Merge Sort LeftArray  Order   Sort RightArray  Order   Order  End Function

User · Answer

From microsoft  Sorting arrays in VBScript has never been easy  that   s because VBScript doesn   t have a sort command of any kind  In turn  that always meant that VBScript scripters were forced to write their own sort routines  be that a bubble sort routine  a heap sort  a quicksort  or some other type of sorting algorithm   So  using  Net as it is installed on my pc    Set outputLines   CreateObject  System Collections ArrayList     add lines outputLines Add output outputLines Add output  outputLines Sort   For Each outputLine in outputLines     stdout WriteLine outputLine Next

User · Answer

You either have to write your own sort by hand  or maybe try this technique     http   www aspfaqs com aspfaqs ShowFAQ asp FAQID 83  You can freely intermix server side javascript with VBScript  so wherever VBScript falls short  switch to javascript

User · Answer

VBScript does not have a method for sorting arrays so you ve got two options    Writing a sorting function like mergesort  from ground up  Use the JScript tip from this article

User · Answer

VBScript does not have a method for sorting arrays so you ve got two options    Writing a sorting function like mergesort  from ground up  Use the JScript tip from this article

User · Answer

Disconnected recordsets can be useful   Const adVarChar   200   the SQL datatype is varchar   Create a disconnected recordset Set rs   CreateObject  ADODB RECORDSET   rs Fields append  SortField   adVarChar  25  rs CursorType   adOpenStatic rs Open rs AddNew  SortField    Some data  rs Update rs AddNew  SortField    All data  rs Update  rs Sort    SortField   rs MoveFirst  Do Until rs EOF     strList strList  amp  vbCrLf  amp  rs Fields  SortField               rs MoveNext Loop   MsgBox strList

User · Answer

Some old school array sorting   Of course this only sorts single dimension arrays    C  DropBox Automation Libraries Array vbs  Option Explicit  Public Function Array AdvancedBubbleSort ByRef rarr ArrayToSort    ByVal rstr SortOrder                                                                                             Date              12 09 1999     Author            Christopher J  Scharer  CJS      Description       Creates a sorted Array from a one dimensional array                         in Ascending  default  or Descending order based on the rstr SortOrder      Variables                             rarr ArrayToSort       The array to sort and return                      rstr SortOrder   The order to sort in  default ascending or D for descending                                                                                             Const const FUNCTION NAME    Array AdvancedBubbleSort      Dim bln Sorted     Dim lng Loop 01     Dim str SortOrder     Dim str Temp      bln Sorted   False     str SortOrder   Left UCase rstr SortOrder   1   We only need to know if the sort order is A SENC  or D ESEND    and for that matter we really only need to know if it s D because we are defaulting to Ascending      Do While  bln Sorted   False         bln Sorted   True         str Temp              If  str SortOrder    D   Then              Sort in descending order              For lng Loop 01   LBound rarr ArrayToSort  To  UBound rarr ArrayToSort  - 1                  If  rarr ArrayToSort lng Loop 01   lt  rarr ArrayToSort lng Loop 01   1   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort lng Loop 01                      rarr ArrayToSort lng Loop 01    rarr ArrayToSort lng Loop 01   1                      rarr ArrayToSort lng Loop 01   1    str Temp                 End If                 If  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1    gt  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1                       rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1     rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01                      rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01    str Temp                 End If             Next         Else              Default to Ascending              For lng Loop 01   LBound rarr ArrayToSort  To  UBound rarr ArrayToSort  - 1                  If  rarr ArrayToSort lng Loop 01   gt  rarr ArrayToSort lng Loop 01   1   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort lng Loop 01                      rarr ArrayToSort lng Loop 01    rarr ArrayToSort lng Loop 01   1                      rarr ArrayToSort lng Loop 01   1    str Temp                 End If                 If  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1    lt  rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01   Then                     bln Sorted   False                     str Temp   rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1                       rarr ArrayToSort  UBound rarr ArrayToSort  - 1  -  lng Loop 01 - 1     rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01                      rarr ArrayToSort  UBound rarr ArrayToSort  - 1  - lng Loop 01    str Temp                 End If             Next         End If     Loop End Function  Public Function Array BubbleSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array BubbleSort      Dim lng Loop 01     Dim lng Loop 02     Dim var Temp      For lng Loop 01    UBound rarr ArrayToSort  - 1  To 0 Step -1         For lng Loop 02   0 To lng Loop 01             If rarr ArrayToSort lng Loop 02   gt  rarr ArrayToSort lng Loop 02   1  Then                 var Temp   rarr ArrayToSort lng Loop 02   1                  rarr ArrayToSort lng Loop 02   1    rarr ArrayToSort lng Loop 02                  rarr ArrayToSort lng Loop 02    var Temp             End If         Next     Next End Function  Public Function Array GetDimensions ByVal rarr Array      Const const FUNCTION NAME    Array GetDimensions      Dim int Dimensions     Dim int Result     Dim str Dimensions      int Result   0     If IsArray rarr Array  Then         On Error Resume Next         Do             int Dimensions   -2             int Dimensions   UBound rarr Array  int Result   1              If int Dimensions  gt  -2 Then                 int Result   int Result   1                 If int Result   1 Then                     str Dimensions   str Dimensions  amp  int Dimensions                 Else                     str Dimensions   str Dimensions  amp       amp  int Dimensions                 End If             End If         Loop Until int Dimensions   -2         On Error GoTo 0     End If     Array GetDimensions   int Result    amp       amp  str Dimensions End Function  Public Function Array GetUniqueCombinations ByVal rarr Fields  ByRef robj Combinations      Const const FUNCTION NAME    Array GetUniqueCombinations      Dim int Element     Dim str Combination      On Error Resume Next      Array GetUniqueCombinations   CBool False      For int Element   LBound rarr Fields  To UBound rarr Fields          str Combination   rarr Fields int Element          Call robj Combinations Add robj Combinations Count  amp       amp  str Combination  0           Call Array GetUniqueCombinationsSub rarr Fields  robj Combinations  int Element      Next  int Element     For int Element   LBound rarr Fields  To UBound rarr Fields          Call Array GetUniqueCombinationsSub rarr Fields  robj Combinations  int Element      Next  int Element     Array GetUniqueCombinations   CBool True  End Function  Array GetUniqueCombinations  Public Function Array GetUniqueCombinationsSub ByVal rarr Fields  ByRef robj Combinations  ByRef rint LBound      Const const FUNCTION NAME    Array GetUniqueCombinationsSub      Dim int Element     Dim str Combination      On Error Resume Next      Array GetUniqueCombinationsSub   CBool False      str Combination   rarr Fields rint LBound      For int Element    rint LBound   1  To UBound rarr Fields          str Combination   str Combination  amp       amp  rarr Fields int Element          Call robj Combinations Add robj Combinations Count  amp       amp  str Combination  str Combination      Next  int Element     Array GetUniqueCombinationsSub   CBool True  End Function  Array GetUniqueCombinationsSub  Public Function Array HeapSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array HeapSort      Dim lng Loop 01     Dim var Temp     Dim arr Size      arr Size   UBound rarr ArrayToSort    1     For lng Loop 01     arr Size   2  - 1  To 0 Step -1         Call Array SiftDown rarr ArrayToSort  lng Loop 01  arr Size      Next     For lng Loop 01    arr Size - 1  To 1 Step -1         var Temp   rarr ArrayToSort 0          rarr ArrayToSort 0    rarr ArrayToSort lng Loop 01          rarr ArrayToSort lng Loop 01    var Temp         Call Array SiftDown rarr ArrayToSort  0   lng Loop 01 - 1       Next End Function  Public Function Array InsertionSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array InsertionSort      Dim lng ElementCount     Dim lng Loop 01     Dim lng Loop 02     Dim lng Index      lng ElementCount   UBound rarr ArrayToSort    1     For lng Loop 01   1 To  lng ElementCount - 1          lng Index   rarr ArrayToSort lng Loop 01          lng Loop 02   lng Loop 01         Do While lng Loop 02  gt  0             If rarr ArrayToSort lng Loop 02 - 1   gt  lng Index Then                 rarr ArrayToSort lng Loop 02    rarr ArrayToSort lng Loop 02 - 1                  lng Loop 02    lng Loop 02 - 1              End If         Loop         rarr ArrayToSort lng Loop 02    lng Index     Next End Function  Private Function Array Merge ByRef rarr ArrayToSort    ByRef rarr ArrayTemp    ByVal rlng Left  ByVal rlng MiddleIndex  ByVal rlng Right                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Merges an array                                                                                             Const const FUNCTION NAME    Array Merge      Dim lng Loop 01     Dim lng LeftEnd     Dim lng ElementCount     Dim lng TempPos      lng LeftEnd    rlng MiddleIndex - 1      lng TempPos   rlng Left     lng ElementCount    rlng Right - rlng Left   1      Do While  rlng Left  lt   lng LeftEnd        And  rlng MiddleIndex  lt   rlng Right          If rarr ArrayToSort rlng Left   lt   rarr ArrayToSort rlng MiddleIndex  Then             rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng Left              lng TempPos    lng TempPos   1              rlng Left    rlng Left   1          Else             rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng MiddleIndex              lng TempPos    lng TempPos   1              rlng MiddleIndex    rlng MiddleIndex   1          End If     Loop     Do While rlng Left  lt   lng LeftEnd         rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng Left          rlng Left    rlng Left   1          lng TempPos    lng TempPos   1      Loop     Do While rlng MiddleIndex  lt   rlng Right         rarr ArrayTemp lng TempPos    rarr ArrayToSort rlng MiddleIndex          rlng MiddleIndex    rlng MiddleIndex   1          lng TempPos    lng TempPos   1      Loop     For lng Loop 01   0 To  lng ElementCount - 1          rarr ArrayToSort rlng Right    rarr ArrayTemp rlng Right          rlng Right    rlng Right - 1      Next End Function  Public Function Array MergeSort ByRef rarr ArrayToSort    ByRef rarr ArrayTemp    ByVal rlng FirstIndex  ByVal rlng LastIndex                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array      Note             The rarr ArrayTemp array that is passed in has to be dimensionalized to the same size                             as the rarr ArrayToSort array that is passed in prior to calling the function                              Also the rlng FirstIndex variable should be the value of the LBound rarr ArrayToSort                              and the rlng LastIndex variable should be the value of the UBound rarr ArrayToSort                                                                                             Const const FUNCTION NAME    Array MergeSort      Dim lng MiddleIndex      If rlng LastIndex  gt  rlng FirstIndex Then           Recursively sort the two halves of the list          lng MiddleIndex     rlng FirstIndex   rlng LastIndex    2          Call Array MergeSort rarr ArrayToSort  rarr ArrayTemp  rlng FirstIndex  lng MiddleIndex          Call Array MergeSort rarr ArrayToSort  rarr ArrayTemp  lng MiddleIndex   1  rlng LastIndex             Merge the results          Call Array Merge rarr ArrayToSort  rarr ArrayTemp  rlng FirstIndex  lng MiddleIndex   1  rlng LastIndex      End If End Function  Public Function Array Push ByRef rarr Array  ByVal rstr Value  ByVal rstr Delimiter      Const const FUNCTION NAME    Array Push      Dim int Loop     Dim str Array 01     Dim str Array 02       If there is no delimiter passed in then set the default delimiter equal to a comma      If rstr Delimiter      Then         rstr Delimiter           End If       Check to see if the rarr Array is actually an Array      If IsArray rarr Array    True Then          Verify that the rarr Array variable is only a one dimensional array          If Array GetDimensions rarr Array   lt  gt  1 Then             Array Push    ERR  the rarr Array variable passed in was not a one dimensional array               Exit Function         End If         If IsArray rstr Value    True Then              Verify that the rstr Value variable is is only a one dimensional array              If Array GetDimensions rstr Value   lt  gt  1 Then                 Array Push    ERR  the rstr Value variable passed in was not a one dimensional array                   Exit Function             End If             str Array 01   Split rarr Array  rstr Delimiter              str Array 02   Split rstr Value  rstr Delimiter              rarr Array   Join str Array 01  amp  rstr Delimiter  amp  str Array 02          Else             On Error Resume Next             ReDim Preserve rarr Array UBound rarr Array    1              If Err Number  lt  gt  0 Then    Subscript out of range   An array that was passed in must have been Erased to re-create it with new elements  possibly when passing an array to be populated into a recursive function                  ReDim rarr Array 0                  Err Clear             End If             If IsObject rstr Value    True Then                 Set rarr Array UBound rarr Array     rstr Value             Else                 rarr Array UBound rarr Array     rstr Value             End If         End If     Else          Check to see if the rstr Value is an Array          If IsArray rstr Value    True Then              Verify that the rstr Value variable is is only a one dimensional array              If Array GetDimensions rstr Value   lt  gt  1 Then                 Array Push    ERR  the rstr Value variable passed in was not a one dimensional array                   Exit Function             End If             rarr Array   rstr Value         Else             rarr Array   Split rstr Value  rstr Delimiter          End If     End If     Array Push   UBound rarr Array  End Function  Public Function Array QuickSort ByRef rarr ArrayToSort    ByVal rlng Low  ByVal rlng High                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array      Note             The rlng Low variable should be the value of the LBound rarr ArrayToSort                              and the rlng High variable should be the value of the UBound rarr ArrayToSort                                                                                             Const const FUNCTION NAME    Array QuickSort      Dim var Pivot     Dim lng Swap     Dim lng Low     Dim lng High      lng Low   rlng Low     lng High   rlng High     var Pivot   rarr ArrayToSort  rlng Low   rlng High    2      Do While lng Low  lt   lng High         Do While  rarr ArrayToSort lng Low   lt  var Pivot           And lng Low  lt  rlng High              lng Low   lng Low   1         Loop         Do While  var Pivot  lt  rarr ArrayToSort lng High            And lng High  gt  rlng Low              lng High    lng High - 1          Loop         If lng Low  lt   lng High Then             lng Swap   rarr ArrayToSort lng Low              rarr ArrayToSort lng Low    rarr ArrayToSort lng High              rarr ArrayToSort lng High    lng Swap             lng Low    lng Low   1              lng High    lng High - 1          End If     Loop     If rlng Low  lt  lng High Then         Call Array QuickSort rarr ArrayToSort  rlng Low  lng High      End If     If lng Low  lt  rlng High Then         Call Array QuickSort rarr ArrayToSort  lng Low  rlng High      End If End Function  Public Function Array SelectionSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array SelectionSort      Dim lng ElementCount     Dim lng Loop 01     Dim lng Loop 02     Dim lng Min     Dim var Temp      lng ElementCount   UBound rarr ArrayToSort    1     For lng Loop 01   0 To  lng ElementCount - 2          lng Min   lng Loop 01         For lng Loop 02    lng Loop 01   1  To lng ElementCount - 1             If rarr ArrayToSort lng Loop 02   lt  rarr ArrayToSort lng Min  Then             lng Min   lng Loop 02             End If         Next         var Temp   rarr ArrayToSort lng Loop 01          rarr ArrayToSort lng Loop 01    rarr ArrayToSort lng Min          rarr ArrayToSort lng Min    var Temp     Next End Function  Public Function Array ShellSort ByRef rarr ArrayToSort                                                                                               Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sorts an array                                                                                             Const const FUNCTION NAME    Array ShellSort      Dim lng Loop 01     Dim var Temp     Dim lng Hold     Dim lng HValue      lng HValue   LBound rarr ArrayToSort      Do         lng HValue    3   lng HValue   1      Loop Until lng HValue  gt  UBound rarr ArrayToSort      Do         lng HValue    lng HValue   3          For lng Loop 01    lng HValue   LBound rarr ArrayToSort   To UBound rarr ArrayToSort              var Temp   rarr ArrayToSort lng Loop 01              lng Hold   lng Loop 01             Do While rarr ArrayToSort lng Hold - lng HValue   gt  var Temp                 rarr ArrayToSort lng Hold    rarr ArrayToSort lng Hold - lng HValue                  lng Hold    lng Hold - lng HValue                  If lng Hold  lt  lng HValue Then                     Exit Do                 End If             Loop             rarr ArrayToSort lng Hold    var Temp         Next     Loop Until lng HValue   LBound rarr ArrayToSort  End Function  Private Function Array SiftDown ByRef rarr ArrayToSort    ByVal rlng Root  ByVal rlng Bottom                                                                                             Date              03 18 2008     Author            Christopher J  Scharer  CJS      Description       Sifts the elements down in an array                                                                                             Const const FUNCTION NAME    Array SiftDown      Dim bln Done     Dim max Child     Dim var Temp      bln Done   False     Do While   rlng Root   2   lt   rlng Bottom        And bln Done   False         If rlng Root   2   rlng Bottom Then             max Child    rlng Root   2          ElseIf rarr ArrayToSort rlng Root   2   gt  rarr ArrayToSort rlng Root   2   1  Then             max Child    rlng Root   2          Else             max Child    rlng Root   2   1          End If         If rarr ArrayToSort rlng Root   lt  rarr ArrayToSort max Child  Then             var Temp   rarr ArrayToSort rlng Root              rarr ArrayToSort rlng Root    rarr ArrayToSort max Child              rarr ArrayToSort max Child    var Temp             rlng Root   max Child         Else             bln Done   True         End If     Loop End Function

User · Answer

You either have to write your own sort by hand  or maybe try this technique     http   www aspfaqs com aspfaqs ShowFAQ asp FAQID 83  You can freely intermix server side javascript with VBScript  so wherever VBScript falls short  switch to javascript

User · Answer

Here s another vbscript implementation of quicksort  This is the in-place  unstable approach as defined in wikipedia  see here  http   en wikipedia org wiki Quicksort   Uses much less memory  original implementation requires upper and lower temporary storage arrays to be created upon every iteration  which can increase memory size by n terms in the worst case    For ascending order  switch the signs    If you want to sort characters  use Asc ch  function    -------------------------------------     quicksort       Carlos Nunez  created  25 April  2010         NOTE    partition function also             required   ------------------------------------- function qsort list  first  last      Dim i  j     if  typeName list   lt  gt   Variant    or ubound list    0  then exit function        list passed must be a collection or array        if the set size is less than 3  we can do a simple comparison sort      if  last-first   lt  3 then         for i   first to last             for j   first to last                 if list i   lt  list j  then                     swap list i j                 end if             next         next     else         dim p idx           we need to set the pivot relative to the position of the subset currently being sorted           if the starting position of the subset is the first element of the whole set  then the pivot is the median of the subset           otherwise  the median is offset by the first position of the subset           -------------------------------------------------------------------------------------------------------------------------         if first-1  lt  0 then             p idx     round  last-first  2 0          else             p idx     round   first-1    last-first  2   0          end if          dim p nidx      p nidx    partition list  first  last  p idx          if p nidx   -1 then exit function          qsort list  first  p nidx-1         qsort list  p nidx 1  last     end if end function   function partition list  first  last  idx      Dim i     partition   -1      dim p val       p val   list idx      swap list idx last     dim swap pos    swap pos   first     for i   first to last-1          if list i   lt   p val then             swap list i swap pos             swap pos   swap pos   1         end if     next     swap list swap pos last      partition   swap pos end function  function swap list a pos b pos      dim tmp     tmp   list a pos      list a pos    list b pos      list b pos    tmp    end function

User · Answer

Here s another vbscript implementation of quicksort  This is the in-place  unstable approach as defined in wikipedia  see here  http   en wikipedia org wiki Quicksort   Uses much less memory  original implementation requires upper and lower temporary storage arrays to be created upon every iteration  which can increase memory size by n terms in the worst case    For ascending order  switch the signs    If you want to sort characters  use Asc ch  function    -------------------------------------     quicksort       Carlos Nunez  created  25 April  2010         NOTE    partition function also             required   ------------------------------------- function qsort list  first  last      Dim i  j     if  typeName list   lt  gt   Variant    or ubound list    0  then exit function        list passed must be a collection or array        if the set size is less than 3  we can do a simple comparison sort      if  last-first   lt  3 then         for i   first to last             for j   first to last                 if list i   lt  list j  then                     swap list i j                 end if             next         next     else         dim p idx           we need to set the pivot relative to the position of the subset currently being sorted           if the starting position of the subset is the first element of the whole set  then the pivot is the median of the subset           otherwise  the median is offset by the first position of the subset           -------------------------------------------------------------------------------------------------------------------------         if first-1  lt  0 then             p idx     round  last-first  2 0          else             p idx     round   first-1    last-first  2   0          end if          dim p nidx      p nidx    partition list  first  last  p idx          if p nidx   -1 then exit function          qsort list  first  p nidx-1         qsort list  p nidx 1  last     end if end function   function partition list  first  last  idx      Dim i     partition   -1      dim p val       p val   list idx      swap list idx last     dim swap pos    swap pos   first     for i   first to last-1          if list i   lt   p val then             swap list i swap pos             swap pos   swap pos   1         end if     next     swap list swap pos last      partition   swap pos end function  function swap list a pos b pos      dim tmp     tmp   list a pos      list a pos    list b pos      list b pos    tmp    end function

User · Answer

From microsoft  Sorting arrays in VBScript has never been easy  that   s because VBScript doesn   t have a sort command of any kind  In turn  that always meant that VBScript scripters were forced to write their own sort routines  be that a bubble sort routine  a heap sort  a quicksort  or some other type of sorting algorithm   So  using  Net as it is installed on my pc    Set outputLines   CreateObject  System Collections ArrayList     add lines outputLines Add output outputLines Add output  outputLines Sort   For Each outputLine in outputLines     stdout WriteLine outputLine Next

User · Answer

Disconnected recordsets can be useful   Const adVarChar   200   the SQL datatype is varchar   Create a disconnected recordset Set rs   CreateObject  ADODB RECORDSET   rs Fields append  SortField   adVarChar  25  rs CursorType   adOpenStatic rs Open rs AddNew  SortField    Some data  rs Update rs AddNew  SortField    All data  rs Update  rs Sort    SortField   rs MoveFirst  Do Until rs EOF     strList strList  amp  vbCrLf  amp  rs Fields  SortField               rs MoveNext Loop   MsgBox strList

User · Answer

Here is a QuickSort that I wrote for the arrays returned from the GetRows method of ADODB Recordset    Author         Eric Weilnau  Date Written   7 16 2003  Description    QuickSortDataArray sorts a data array using the QuickSort algorithm                  Its arguments are the data array to be sorted  the low and high                 bound of the data array  the integer index of the column by which the                 data array should be sorted  and the string  asc  or  desc  for the                 sort order    Sub QuickSortDataArray dataArray  loBound  hiBound  sortField  sortOrder      Dim pivot    loSwap  hiSwap  count     ReDim pivot UBound dataArray        If hiBound - loBound   1 Then         If  sortOrder    asc  and dataArray sortField loBound   gt  dataArray sortField hiBound   or  sortOrder    desc  and dataArray sortField loBound   lt  dataArray sortField hiBound   Then             Call SwapDataRows dataArray  hiBound  loBound          End If     End If      For count   0 to UBound dataArray          pivot count    dataArray count int  loBound   hiBound    2           dataArray count int  loBound   hiBound    2     dataArray count loBound          dataArray count loBound    pivot count      Next      loSwap   loBound   1     hiSwap   hiBound      Do         Do While  sortOrder    asc  and dataArray sortField loSwap   lt   pivot sortField   or sortOrder    desc  and  dataArray sortField loSwap   gt   pivot sortField               loSwap   loSwap   1              If loSwap  gt  hiSwap Then                 Exit Do             End If         Loop          Do While  sortOrder    asc  and dataArray sortField hiSwap   gt  pivot sortField   or  sortOrder    desc  and dataArray sortField hiSwap   lt  pivot sortField               hiSwap   hiSwap - 1         Loop          If loSwap  lt  hiSwap Then             Call SwapDataRows dataArray loSwap hiSwap          End If     Loop While loSwap  lt  hiSwap      For count   0 to Ubound dataArray          dataArray count loBound    dataArray count hiSwap          dataArray count hiSwap    pivot count      Next      If loBound  lt   hiSwap - 1  Then         Call QuickSortDataArray dataArray  loBound  hiSwap-1  sortField  sortOrder      End If      If  hiSwap   1   lt  hiBound Then         Call QuickSortDataArray dataArray  hiSwap 1  hiBound  sortField  sortOrder      End If End Sub

[vbscript] How do I sort arrays using vbscript?

Examples related to vbscript

Examples related to sorting