0 Members and 2 Guests are viewing this topic.
I am sure I would enjoy this if I knew any z80. I'm actually doing the same thing in my Java class. Nice.
My only concern at a glance is how it keeps popping without pushing.
Hmm what stuff does it sort in particular? Or is it an all-purpose sorting routine?
quicksort :: (Ord a) => [a] -> [a]quicksort [] = []quicksort (x:xs) = quicksort [ a | a <- xs, a <= x] ++ [x] ++ quicksort [ a | a <- xs, a > x]
O.o. wow, Haskell is........short?