Recursive Quicksort

Hi !!!
This is an algorithmn to quicksort an array on n numbers

Quicksort(Array A, first, last)
{
        middle=lowerbound(first+last/2);
        Quicksort(A,first, middle);
       Quicksort(A, middle+1, last);
}


post an iterative solution to it....