Fast random integer (not duplicatenumber)c#

Scripting
,
1 
 private void RunScript(Interval domain, int count, int seed, ref object A, ref object B)
  {

    System.Random random = new System.Random();
    var s = (int) (domain.Min);
    var e = (int) (domain.Max);
    dynamic list = new List<dynamic>(0);
    dynamic selection = 0.1;
    var n = count <= e - s ? count : e - s;
    for(int j = 0;j < (int) n  ;j++){
      int nx = n;
      for(int i = j;i < nx;i++){
        selection = random.Next(s, e + 1);
        if(list.Contains(selection) && list.Count <= n)
          continue;
        else if(list.Count <= n)
          list.Add(selection);
        if(list.Count >= n)
          break;}
      if(list.Count >= n)
        break;
    }
    B = list;

random integer no duplicatenumber
random integer no duplicatenumber1545×479 88.8 KB

hi is there way to faster my code for(random integer not duplicate Number)c#?
random integer no duplicatenumber.gh (9.5 KB)

2 
private void RunScript(Interval domain, int count, int seed, ref object A)
{
  var rnd = new Random(seed);
  A = Enumerable.Range((int) domain.Min, (int) domain.Max).OrderBy(c => rnd.Next()).Take(count).ToArray();
}

Random.gh (4.9 KB)

1 Like
3

thanks

hh
hh1015×683 87.2 KB

@Mahdiyar but in some seed the for exmplenumbrs(79)> domain(intrval (10,70)
Random-overflows.gh (7.9 KB)

4

i found solution

  private void RunScript(Interval domain, int count, int seed, ref object A)
  {
    var rnd = new Random(seed);
    int e = (int) domain.Max - (int) domain.Min;
    A = Enumerable.Range((int) domain.Min, e).OrderBy(c => rnd.Next()).Take(count).ToArray();
  }
1 Like