To read the article online, visit http://www.4GuysFromRolla.com/webtech/012799-2.shtml

 Sorting Arrays: VBScript Implementation For the past six months or so, I've been reading and participating in a number of ASP ListServ groups. One question which arises often is how to sort an array efficiently. There are *many* sorting algorithms available, each having its own advantages and disadvantages. The simplest sort, a bubble sort, is good for small arrays, especially ones that are nearly sorted already. However, as the set of data to be sorted starts to grow, a bubble sort becomes quite inefficient. The sort that is regarded as the best sort for large arrays that are NOT nearly sorted is Quicksort. Quicksort uses a divide and conquer approach, dividing the total array in half, then recursively dividing each half info halves, and those halves into halves and so on and so on. Eventually, it just has two values, and can swap them if needed. While this is not exactly how a Quicksort works, it is a general description. What to remember is that a Quicksort uses a divide and conquer approach utilizing recursion. This leads to a big O of N log N. I implemented this Quicksort algorithm using VBScript. Since you can use VBScript as a server-side language with ASP, its cut & paste time. You can also, as this code shows, use your Quicksort algorithm with client-side scripting as well (although if you choose to use client side scripting, I would highly recommend a JavaScript implementation, which can be found here). An implementation of Quicksort in JavaScript can be found via this URL. An algorithm to sort a two dimensional array can be found at this URL. ``````<%@ Language="VBScript" %> <% '== This entire piece of code was shamelessly stolen from '== the 4 Guys From Rolla WebWeekly newsletter, translated '== to VBScript and changed into server-side ASP code. '== Every effort has been made to keep comments intact. Response.Write "" Sub QuickSort(vec,loBound,hiBound) Dim pivot,loSwap,hiSwap,temp '== This procedure is adapted from the algorithm given in: '== Data Abstractions & Structures using C++ by '== Mark Headington and David Riley, pg. 586 '== Quicksort is the fastest array sorting routine for '== unordered arrays. Its big O is n log n '== Two items to sort if hiBound - loBound = 1 then if vec(loBound) > vec(hiBound) then temp=vec(loBound) vec(loBound) = vec(hiBound) vec(hiBound) = temp End If End If '== Three or more items to sort pivot = vec(int((loBound + hiBound) / 2)) vec(int((loBound + hiBound) / 2)) = vec(loBound) vec(loBound) = pivot loSwap = loBound + 1 hiSwap = hiBound do '== Find the right loSwap while loSwap < hiSwap and vec(loSwap) <= pivot loSwap = loSwap + 1 wend '== Find the right hiSwap while vec(hiSwap) > pivot hiSwap = hiSwap - 1 wend '== Swap values if loSwap is less then hiSwap if loSwap < hiSwap then temp = vec(loSwap) vec(loSwap) = vec(hiSwap) vec(hiSwap) = temp End If loop while loSwap < hiSwap vec(loBound) = vec(hiSwap) vec(hiSwap) = pivot '== Recursively call function .. the beauty of Quicksort '== 2 or more items in first section if loBound < (hiSwap - 1) then Call QuickSort(vec,loBound,hiSwap-1) '== 2 or more items in second section if hiSwap + 1 < hibound then Call QuickSort(vec,hiSwap+1,hiBound) End Sub 'QuickSort Sub PrintArray(vec,lo,hi) '== Simply print out an array from the lo bound to the hi bound. Dim i For i = lo to hi Response.Write vec(i) & "
" Next End Sub 'PrintArray Randomize Dim x(9) For z = 0 to 9 x(z) = int(Rnd*1000) If (Rnd < 0.5) then x(z) = x(z)-1000 Next Response.Write "Here is a jumbled array:
" Call PrintArray(x,0,9) Call QuickSort(x,0,9) Response.Write "Now the array is sorted!
" Call PrintArray(x,0,9) Response.Write "" %> `````` Happy Programming!

 Article Information Article Title: 4GuysFromRolla.com - Sorting Arrays (VBScript Implementation) Article Author: Kevin Moon Published Date: Wednesday, January 27, 1999 Article URL: http://www.4GuysFromRolla.com/webtech/012799-2.shtml