Golf time

I'm the proud new owner of the most suspicious-looking gift certificate ever:

Despite the fact that it's already expired and the amount has been crossed out multiple times, it's supposedly legit. We'll see if the golf course accepts it..

I won it in the weekly office happy hour competition. This week the challenge was to write an implementation of a function with the signature "void ArraySort(int[] array, int length)" that has O(1) memory usage. This was my entry:


void ArraySort(int _array[], int _length)
{
_asm
{
push _mysort
push 4
mov eax, [_length]
push eax
mov eax, [_array]
push eax
mov eax, [qsort]
call eax
add esp, 16
jmp _done
_mysort:
mov edx, [ebp-8]
mov ecx, [ebp-4]
mov eax, [ecx]
cmp eax, [edx]
jle _le
mov eax, 1
ret
_le:
cmp eax, [edx]
jge _ge
mov eax, -1
ret
_ge:
xor eax, eax
ret
_done:
}
}


I particularly like this implementation because the code for the qsort callback is embedded inside the ArraySort function. I was sad that not everybody else appreciated the sublime beauty of this as much as I did.