i've been trying to learn haskell (up to, but not including the m-word!) but i've learned enough to appreciate that haskell can truly represent the quicksort algorithm in a very simple and elegant way.
I tried to translate it to GP using its built-in filter block but i couldn't get it to work, so i wrote my own filter instead.
Post your nifty GP projects here!
1 post • Page 1 of 1