[racket] quick-sort algorithm in scheme could be used in real world?

From: Li Weijian (liweijian.hust at gmail.com)
Date: Wed Nov 13 22:53:20 EST 2013

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?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20131114/7aa40b79/attachment.html>

Posted on the users mailing list.