Re: can this code be improved
"Print Guy" <jctown@nb.sympatico.ca> writes:
Here in Canada, we have a lottery called 6-49.
No, this lottery in fact is located here in Germany, and it's
called "6 aus 49".
I wanted to come up with a statistically solid way to pick my
numbers so I figured that if I were to pick 6 numbers 1,000,000
times and count the number of times each number is selected,
the top six would be good numbers to bet on during the lottery.
Actually the numbers are best, which are most rarely chosen
by other players, because then the rates will be higher.
Here is my code. What I am hoping for is some constructive criticism
which could help me to make the code more efficient.
Destructive criticism is much more fun!
Rank 1 number is 43
class NumericMapUtils
{ public static <D> void addTo
( final java.util.Map<D,java.lang.Integer> map, final D d, final int i )
{ map.put( d, i +( map.containsKey( d )? map.get( d ): 0 )); }}
public class Main
{ static final java.util.Random rand = new java.util.Random();
public static void main( java.lang.String[] args )
{ final java.util.Map<java.lang.Integer,java.lang.Integer> map
= new java.util.HashMap<java.lang.Integer,java.lang.Integer>( 50 );
for( int i = 0; i < 1000; ++i )
NumericMapUtils.<java.lang.Integer>addTo( map, rand.nextInt( 49 ), 1 );
final java.util.SortedMap<java.lang.Integer,java.lang.Integer> sort
= new java.util.TreeMap<java.lang.Integer,java.lang.Integer>();
for( final java.lang.Integer i : map.keySet() )sort.put( -map.get( i ), i );
int c = 0; for( final int i : sort.keySet() )
{ java.lang.System.out.println
( "Rank " +( c + 1 )+ " number is " + sort.get( i ));
if( ++c >= 6 )break; }}}
Rank 1 number is 21
Rank 2 number is 14
Rank 3 number is 34
Rank 4 number is 15
Rank 5 number is 47
Rank 6 number is 20
However, there is a small chance that ?nextInt? will return
the same number for 1000 times, so that the program would only
output one number; but I tried to implement your general
description.