As a Notes developer, I have never been really interested in sorting algorithms.  For me, I just want to sort something ascending or descending and I don't really care how it works or which sort routine is better suited for a given task.  That being said, from time to time, I have had to delve into the world of sorting and have compiled a LSS file that contains 3 of the more popular sorting routines: Bubble Sort, Quick Sort, and Merge Sort.  This LSS file is now available in the Code Bin on OpenNTF.org.

No more will I have to go searching through my collection of past databases to find that one sort routine that sorts DateTime values.  No I can just include the LSS file and easily select which algorithm I want to use and the type of data being sorted and get my results with no muss, no fuss.  Just the way I like it!