I found the quick-sort in HTDP: http://www.htdp.org/2003-09-26/Book/curriculum-Z-H-32.html#node_sec_25.2
This algorithm is not an in place algorithm such as we implement in java/c++. I am curious such that LISP quick-sort algorithm could be used in real world?
____________________ Racket Users list: http://lists.racket-lang.org/users
