How slow are functional implementations of quicksort?

His first example for tail recursion is grossly wrong, it is an almost canonical example for a fuction that is <i>not</i> tail recursive, as the last thing it does is consing somthing with the result of calling itself recursively.