iritmaximus/haskell
1
0
Fork 0
mirror of https://github.com/iritmaximus/haskell.git synced 2026-10-12 19:13:39 +03:00
Code Issues Packages Projects Releases Wiki Activity

winner implemented

Browse Source
This commit is contained in:
Aaro Koivukangas
2025-12-22 15:45:16 +02:00
parent 21eeb2bc28
commit 487704999d
1 changed files with 9 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
exercises/Set4a.hs
+9 -1
View File
@@ -176,7 +176,15 @@ average xs = (sum xs) / (fromIntegral (length xs))
-- ==> "Lisa"
winner :: Map.Map String Int -> String -> String -> String
winner scores player1 player2 = todo
-- winner scores player1 player2 = Map.findWithDefault 0 player1 scores : Map.findWithDefault 0 player2 scores : []
winner scores player1 player2 = case compare p1_score p2_score of
EQ -> player1
GT -> player1
LT -> player2
where
p1_score = Map.findWithDefault 0 player1 scores
p2_score = Map.findWithDefault 0 player2 scores
------------------------------------------------------------------------------
-- Ex 9: compute how many times each value in the list occurs. Return