[racket] HtDP: Why is quick-sort considered generative recursion?

From: Jay (planarian at hotmail.com)
Date: Fri Apr 22 20:14:41 EDT 2011


I don't understand what aspect of the quick-sort algorithm (as presented in How to Design Programs) makes it an instance of generative recursion; it looks to me like a structural problem.

I'd appreciate any clarification.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20110423/23a24c68/attachment.html>

Posted on the users mailing list.