all tasks

Task/Sorting-algorithms-Stooge-sort/Haskell/sorting-algorithms-stooge-sort-1.hs

@@ -0,0 +1,20 @@
+import Data.List
+import Control.Arrow
+import Control.Monad
+
+insertAt e k = uncurry(++).second ((e:).drop 1). splitAt k
+
+swapElems :: [a] -> Int -> Int -> [a]
+swapElems xs i j = insertAt (xs!!j) i $ insertAt (xs!!i) j xs
+	
+stoogeSort [] = []
+stoogeSort [x] = [x]
+stoogeSort xs = doss 0 (length xs - 1) xs
+doss :: (Ord a) => Int -> Int -> [a] -> [a]
+doss i j xs
+      | j-i>1 = doss i (j-t) $ doss (i+t) j $ doss i (j-t) xs'
+      | otherwise = xs'
+    where t = (j-i+1)`div`3
+	  xs'
+	    | xs!!j < xs!!i = swapElems xs i j
+	    | otherwise = xs

Task/Sorting-algorithms-Stooge-sort/Haskell/sorting-algorithms-stooge-sort-2.hs

@@ -0,0 +1,2 @@
+*Main> stoogeSort [1, 4, 5, 3, -6, 3, 7, 10, -2, -5, 7, 5, 9, -3, 7]
+[-6,-5,-3,-2,1,3,3,4,5,5,7,7,7,9,10]