omg just a bit overwhelming 
searching for mem tricks,... non?!
scanning code, i stumbled right onto one flaw about quicksort, CG has like 8 versions of it, one says in effect you don't need quick sort for an already sorted array or that is quick sorts main weakness thus my Load Sort is perfect complement to quick sort, for my own tool box anyway, i am a collector of only of the best of what i find and can work with easily. just need that mem trick to shift the array over.... working on it
imagine using quick sort every time you add an item to an array from the start at nothing, total that time up and see what a proper load sort can do for you, not saying i have it, yet!, but saying why i think it important ;-))
searching for mem tricks,... non?!
scanning code, i stumbled right onto one flaw about quicksort, CG has like 8 versions of it, one says in effect you don't need quick sort for an already sorted array or that is quick sorts main weakness thus my Load Sort is perfect complement to quick sort, for my own tool box anyway, i am a collector of only of the best of what i find and can work with easily. just need that mem trick to shift the array over.... working on it
imagine using quick sort every time you add an item to an array from the start at nothing, total that time up and see what a proper load sort can do for you, not saying i have it, yet!, but saying why i think it important ;-))
b = b + ...