[Haskell-beginners] For most geometric algorithms (e.g. Graham Scan) sorting the points & not using trig functions is usually better.

Often you sort the points to find a boundary point (extremal point). Using trig functions burns a lot of CPU cycles so if one can use the inner product, etc. so much the better. -- -- Regards, KC