areEqual :: Int -> Int -> Int
areEqual x y =
  if x == y then 1
  else 0

countRepetitions :: Int -> [Int] -> Int
countRepetitions _ [] = 0
countRepetitions x (y:list) = (areEqual x y) + (countRepetitions x list)

auxGetModa :: Int -> [Int] -> Int -> Int
auxGetModa x [] suma = x
auxGetModa x (y:list) suma =
  if  (max ((countRepetitions x list) + (areEqual x y)) suma)  > (countRepetitions y list)  then (auxGetModa x list (max ((countRepetitions x list) + (areEqual x y)) suma))
  else (auxGetModa y list (countRepetitions y list))

getModa :: Int -> Int -> Int -> Int -> Int -> Int
getModa a b c d e = (auxGetModa a (a:b:c:d:e:[]) 0)

len :: [a] -> Int
len [] = 0
len (x:xs) = 1 + len xs

getPow :: Double -> Int -> Double
getPow _ 0 = 1
getPow x n = x * (getPow x (n-1))

auxEvaluate :: [Double] -> Double -> Int -> Double
auxEvaluate (y:list) x 0 = y
auxEvaluate (y:list) x n = y * (getPow x n) + (auxEvaluate list x (n-1))

evaluate :: [Double] -> Double -> Double
evaluate [] _ = 0.0
evaluate list x = (auxEvaluate list x ((len list)-1))

xSort :: [Int] -> [Int]
xSort [] = []
xSort (x:list) = (xSort (filter (<x) list))++[x]++(xSort (filter (>=x) list))


--data Arbol e = Nodo (Arbol e) e (Arbol e) | ArbolVacio

--ABB = (Nodo (Nodo (Nodo ArbolVacio 2 ArbolVacio) 5 (Nodo ArbolVacio 7 ArbolVacio)) 8 (Nodo ArbolVacio 9 (Nodo (Nodo ArbolVacio 11 ArbolVacio) 15 ArbolVacio)))


--posOrden :: Arbol a -> [a]
--posOrden ArbolVacio = []
--posOrden (Nodo l n r) =
--(podOrden l)++(posOrden r)++[n]

main = do
print(getModa 8 1 5 4 3)
print(getModa 4 2 3 2 1)
print(getModa 2 3 3 2 3)
print(evaluate [] 100)
print(evaluate [2,3.1,10,0] 2)
print(evaluate [10,0] 2)
print(evaluate [1,2,3,4,5] 3)
print(xSort [])
print(xSort [1])
print(xSort [1,6,3,10,2,14])
--print(posOrdenABB ABB)