Who's the big winner?

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
{--

From P24 of the P-99 problem set.

1. LOTTO! Who's the big winner?

create a function: --}

lotto :: Int -> Int -> IO [Int]
lotto n max = undefined

{--

such that lotto picks n unique numbers from the domain [1..max].

The 'picks' are done 'randomly' (as practicable).

2. Okay, so lotto 6 49 generates how many possibilities? Does that
generation happen before you make your selection? Ouch! If you're
picking from a list of pregenerated 49 Choose 6 sequences, improve
the algorithm so that the result is obtained faster. Much faster.

 --}