Question

This has to be done in Haskell only.

Write a program that:

Given 2 poker hands (5 cards) in list of tuples form (ex. hand1 = [(1,0),(2,0),(3,0),(4,0),(5,0)]). Each tuple represents a card where first number of a tuple is its value (1=Ace, 2=2,...,10=10, 11=Jack, 12=Queen, 13=King) and second number its suit (0=Clubs, 1=Diamonds, 2=Hearts, 3=Spades) so (1,0) will be Ace of Clubs, or (5,2) will be 5 of Hearts, etc.

Rule website: https://www.fgbradleys.com/et_poker.asp

These hands are generated by an end user. Write a program that will analyze each hand according to the rules from the
website above (regular poker rules) and decide a winner (output a winning hand).

There will be no ties. If both hands have the same type, we will implement tie breaking
based on the ranks of the cards. For example, if both hands are a flush, then the hand with
the card of highest rank is declared the winner. If both hands have a pair, then the hand
whose pair is higher wins. For example, a pair of Kings beats a pair of Sevens. If both hands
have the same pair, i.e. each hand has a pair of threes, then the hand with the next highest
card wins. If both hands have the same pair, and the same high card, we check the 2nd
highest card. And so on, and so forth.

If, after comparing hands and ranks, it turns out that the hands are identical, we move on to
tie-breaking by suit. If both hands have a pair of threes, and all other cards are of the same
rank, then the hand with the three of spades will win. Keep in mind that tie breaking based
on suit only comes into effect when tie breaking based on rank is impossible. Suits are
ranked from lowest to highest in the following order: Clubs < Diamonds < Hearts < Spades.

Answer 1

 ort hand by suit: smallest suit card first .... (Finding a flush is eaiser that way) --------------------------------------------- */ public static void sortBySuit( Card[] h ) { int i, j, min_j;  /* --------------------------------------------------- The selection sort algorithm --------------------------------------------------- */ for ( i = 0 ; i < h.length ; i ++ ) { /* --------------------------------------------------- Find array element with min. value among h[i], h[i+1], ..., h[n-1] --------------------------------------------------- */ min_j = i; // Assume elem i (h[i]) is the minimum for ( j = i+1 ; j < h.length ; j++ ) { if ( h[j].suit() < h[min_j].suit() ) { min_j = j; // We found a smaller suit value, update min_j } }  /* --------------------------------------------------- Swap a[i] and a[min_j] --------------------------------------------------- */ Card help = h[i]; h[i] = h[min_j]; h[min_j] = help; } }