236 reputation
24
bio website google.com
location Israel
age 29
visits member for 3 years, 5 months
seen Aug 1 at 21:41

BSC in SW engineering student, intrested in automata, formal languages, algorithms, data structures and OOP languages, especially Java.


Aug
1
comment Permutation tests for large sequences
@Oreochromis No, you need 8.1e7 bits, not 2^8.1e7. (You need log_2(4,000,000!) ~= 8.1e7)
Jul
31
comment Permutation tests for large sequences
Not a PRNG expert, so I have no idea what the internal state should be, but you need at least 8.1e7 pseudo random bits to achieve uniform distribution.
Jul
31
comment Permutation tests for large sequences
(Note that while I saw the comment discouraging you from posting on StackOverflow, IMO it's perfectly on-topic there as well under the algorithm tag)
Jul
31
answered Permutation tests for large sequences
Aug
20
awarded  Enlightened
Apr
25
awarded  Yearling
Jan
13
awarded  Nice Answer
Jan
13
comment Is there a way to handle nested Collections more elegantly?
Will the downvoter explain? I assumed here the OP actually is trying to map : (A,B,Integer) -> C, and thus the nested Map usage. The edit also supports my preception.
Jan
13
answered Is there a way to handle nested Collections more elegantly?
Jan
11
awarded  Supporter
Apr
25
awarded  Teacher
Apr
25
awarded  Autobiographer