Re: [math-fun] convex hull

That can't be right, because (among other things), convex hull spits out its points sorted by both the X & Y axes, & hence can be used for sorting. If convex hull could be done in linear time, then so could sorting. At 04:14 PM 8/13/2013, Steve Witham wrote: In 2D at least, there's a linear-time algorithm that works something like the linear-time median... According to the Cormen, Leiserson, Rivest & Stein _Algorithms_ book (the fat one with the mobile on the cover).