There are different algorithms for sorting an array of strings. Time-critical client applications often use the algorithm called Quicksort, which is very efficient for such applications. This two-part article series takes a close look at writing and using such a function.
At the moment I am writing a series of articles concerning database programming. Some recordset APIs are supplied with a Sort function; you just use the Sort function without knowing how it was written. Other APIs may not have any sort function; this means that you have to write the sort function yourself (when you need one). So, if you are a database programmer, knowing how to write an efficient sort function is a big plus. In this article, I show you how to write the Quicksort function, which is very efficient for traditional (client side) database programming.
There are other reasons why you would want to understand sort functions, in particular the Quicksort function. Maybe you want to write a database programming API. Maybe you did not understand the topic well when you studied it in college or at a university. Maybe they did not even cover it at your university.
Maybe you are a self-taught programmer and you want to learn more. Maybe you are a teacher or lecturer and you want to get a better understanding of the topic in order to teach it well. Maybe you want to write a Sort function for an array of strings, which is not concerned with a database.
Well, I will show you how to write only the Quicksort function, since it is the type relevant to the series I am writing. I will use JavaScript. You need a browser and text editor to try the code.
JavaScript 
/ 4 
QuickSort in Action
