[racket] Partion

2012/3/16 Danny Yoo <dyoo at cs.wpi.edu>:

> Hmmm... Questions: why is a list-based approach a requirement?

Er. Well. A vector based solution would be fine too.

> Do the
> numbers share a special characteristic, such as being densely packed
> into a tight range?  If so, bucket sorting could be applied to get
> fast O(n) sorting at this stage.

The numbers are coordinates of the corners of bounding rectangles
of two-dimensional objects. I don't expect a particular distribution.

--
Jens Axel Søgaard