// Gremlin: See Quicksort Integers, Quicksort Strings and Quicksort Map Stable
list sortStrings = [ "aza", "aba", "aaa", "ana", "ban", "aaaa", "abarbecue" ];

integer stringComparer(list a, list b) {

    list alph = [ "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z" ];

    integer i;
    
    for(i=0; i<llStringLength(llList2String(a, 0)) && i<llStringLength(llList2String(b, 0)); i++) {
        if(llListFindList(alph, (list)llGetSubString(llList2String(a, 0), i, i)) < llListFindList(alph, (list)llGetSubString(llList2String(b, 0), i, i))) {
            return TRUE;
        }
        if(llListFindList(alph, (list)llGetSubString(llList2String(a, 0), i, i)) > llListFindList(alph, (list)llGetSubString(llList2String(b, 0), i, i))) {
            return FALSE;
        }
        
    }
    return TRUE;
}

list quicksort(list a) {

    if(llGetListLength(a) <= 1) return a;
    
    list pivot = llList2List(a, llGetListLength(a)/2, llGetListLength(a)/2);
    a = llDeleteSubList(a, llGetListLength(a)/2, llGetListLength(a)/2);
    
    list less = [];
    list more = [];
    
    
    integer i;
    for(i=0; i<llGetListLength(a); i++) {
        if(stringComparer(llList2List(a, i, i), pivot) == TRUE)
            less += llList2List(a, i, i);
        else
            more += llList2List(a, i, i);
    }
    return quicksort(less) + (list)pivot + quicksort(more);

}

default
{
    state_entry()
    {
        llOwnerSay("Sorted list contains in order: " + llDumpList2String(quicksort(sortStrings), " "));
    } 
}