integer java 随机,如何在Java中生成随机BigInteger值?

这篇博客探讨了如何利用BigInteger的构造函数生成指定范围内的随机整数,特别是当这个范围不是2的幂时。作者提出了一种利用循环和mod运算的方法,确保结果均匀分布且避免了过多的迭代。如果随机数生成器(RNG)效率较低,还提供了一个优化的版本,限制了循环次数,但可能会增加mod运算的计算成本。
摘要由CSDN通过智能技术生成

I need to generate arbitrarily large random integers in the range 0 (inclusive) to n (exclusive). My initial thought was to call nextDouble and multiply by n, but once n gets to be larger than 253, the results would no longer be uniformly distributed.

BigInteger has the following constructor available:

public BigInteger(int numBits, Random rnd)

Constructs a randomly generated BigInteger, uniformly distributed over the range 0 to (2numBits - 1), inclusive.

How can this be used to get a random value in the range 0 - n, where n is not a power of 2?

解决方案

Use a loop:

BigInteger r;

do {

r = new BigInteger(n.bitLength(), rnd);

} while (r.compareTo(n) >= 0);

on average, this will require less than two iterations, and the selection will be uniform.

Edit: If your RNG is expensive, you can limit the number of iterations the following way:

int nlen = n.bitLength();

BigInteger nm1 = n.subtract(BigInteger.ONE);

BigInteger r, s;

do {

s = new BigInteger(nlen + 100, rnd);

r = s.mod(n);

} while (s.subtract(r).add(nm1).bitLength() >= nlen + 100);

// result is in 'r'

With this version, it is highly improbable that the loop is taken more than once (less than one chance in 2^100, i.e. much less than the probability that the host machine spontaneously catches fire in the next following second). On the other hand, the mod() operation is computationally expensive, so this version is probably slower than the previous, unless the rnd instance if exceptionally slow.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值