2016 Update

Task/Cholesky-decomposition/Haskell/cholesky-decomposition-2.hs

@@ -2,21 +2,17 @@ import Data.Array.IArray
 import Data.List
 import Cholesky
 
-takeDrop 0 xs = ([],xs)
-takeDrop _ [] = ([],[])
-takeDrop n (x:xs) = (x:a,b) where (a,b) = takeDrop (n-1) xs
-
 fm _ [] = ""
 fm _ [x] = fst x
 fm width ((a,b):xs) = a ++ (take (width - b) $ cycle " ") ++ (fm width xs)
 
 fmt width row (xs,[]) = fm width xs
-fmt width row (xs,ys) = fm width xs  ++ "\n" ++ fmt width row (takeDrop row ys)
+fmt width row (xs,ys) = fm width xs  ++ "\n" ++ fmt width row (splitAt row ys)
 
 showMatrice row xs   = ys where
   vs = map (\s -> let sh = show s in (sh,length sh)) xs
-  width = (maximum $ snd $ unzip vs) + 2
-  ys = fmt width row (takeDrop row vs)
+  width = (maximum $ snd $ unzip vs) + 1
+  ys = fmt width row (splitAt row vs)
 
 ex1, ex2 :: Arr
 ex1 = listArray ((0,0),(2,2)) [25, 15, -5,