899afc7287cab21833580ca4a8467f9b718e2b4d
The old code in fact increased the complexity to O(n^2), because we applied 'elem' which is O(n) to every element of xs. Instead we compare (in case of partitioning against Y) the y-value of every element of xs with the y-value of the pivot which tells us if x lies within ys.
Random computer graphics algorithms visualized with the Diagrams library
Building
cabal build (you need cabal)
Running
cabal run Gtk -- file.obj
or
cabal run Gif -- -w 600 -h 600 -o out.gif
Build Status
Languages
Haskell
91.5%
Cabal Config
6.1%
Wavefront Object
2.4%
