Data update

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

@@ -6,7 +6,7 @@ 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
@@ -15,6 +15,6 @@ 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
+    xs'
+      | xs!!j < xs!!i = swapElems xs i j
+      | otherwise = xs