// Gremlin: See Quicksort Integers, Quicksort Strings and Quicksort Map Stable
list sortIntegers = [ 3,7,8,5,2,1,9,5,4 ];

integer integerComparer(list a, list b) {
    if(llList2Integer(a, 0) <= llList2Integer(b, 0)) return TRUE;
    return FALSE;
}

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(integerComparer(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(sortIntegers), " "));
    } 
}