[[ABK]Antonio]

Quote:

Originally Posted by ****** It is what is called a recursive algorithm. It sorts the array by sorting the low half then the high half, and for each of those halves it first sorts the low half (quarter) and the high half (quarter) etc. There are ways to explicitly code the stack and avoid function recursion, and also ways to optimise for small arrays - I've just not implemented those things yet.

Oh ok - it's an interesting function :P (at least for me to read)