'Backup'

08_Haskell/ex1-tutorial.hs

@@ -4,22 +4,23 @@ main = do
   print [1..10]
 
 
+
 -- fType :: Int -> Int -> Int 
 -- fType x y = x*x + y*y
 -- main = print (fType 2 4) 
 
 
 
---fType :: Integer -> Integer -> Integer 
---fType x y = x*x + y*y 
---main = print (fType 212124454 4454545445455454545445445454544544638247328432894364872648762378462378647823547267865435843685734857394785) 
+-- fType :: Integer -> Integer -> Integer 
+-- fType x y = x*x + y*y 
+-- main = print (fType 212124454 44545454454554545454454454545445446382473284328943648726487623784623786478235472678654358436857348573947854454545445455454545445445454544544638247328432894364872648762378462378647823547267865435843685734857394785) 
 
 
 
---fact :: Integer -> Integer 
---fact n | n == 0 = 1 
+-- fact :: Integer -> Integer 
+-- fact n | n == 0 = 1 
 --       | n /= 0 = n * fact (n-1) 
---main = do 
+-- main = do 
 --   putStrLn "The factorial of 5 is:"  
 --   print (fact 5) 
 
@@ -94,12 +95,11 @@ main = do
 -- multList n (x:xs) = n*x : multList n xs
 -- tripleList = multList 3
 -- doubleList = multList 2
-
 -- main = do 
 --  let x = [1..10] 
 --  putStrLn "Our list is:"
 --  print (x) 
---  --print (doubleListA x)
+--  print (doubleListA x)
 --  print (doubleList x)
 
 
@@ -121,7 +121,6 @@ main = do
 
 
 -- import Data.List  
-
 -- main = do  
 --    putStrLn("Different methods of List Module") 
 --    print(intersperse '.' "Tutorialspoint.com") 
@@ -130,9 +129,3 @@ main = do
 --    print (sort [8,5,3,2,1,6,4,2])
 
 
-
--- factors n = [x | x <- [1..n], mod n x == 0]
--- prime n = factors n == [1,n]
--- main = do
---  print (prime 9)
---  print (prime 19)