Picking a random element from a set

by 
int size = myHashSet.size();
int item = new Random().nextInt(size); // In real life, the Random object should be rather more shared than this
int i = 0;
for(Object obj : myhashSet)
{
    if (i == item)
        return obj;
    i++;
}

More Related Contents:

  1. Obtaining a powerset of a set in Java
  2. Take n random elements from a List?
  3. Iteratively compute the Cartesian product of an arbitrary number of sets
  4. How to generate a random permutation in Java?
  5. Randomly Generate Letters According to their Frequency of Use?
  6. best way to pick a random subset from a collection?
  7. Generate Random Numbers in Array [duplicate]
  8. Random Number Algorithm – Implementation in Java
  9. Graph theory puzzle about connectivity?
  10. How to check if an integer is in a set of given ranges? [closed]
  11. Algorithm to divide a given number in two proportions by one of the component of that number
  12. What’s the best way to build a string of delimited items in Java?
  13. Efficient swapping of elements of an array in Java
  14. Java: random long number in 0
  15. What is the best way get the symmetric difference between two sets in java?
  16. Why use inheritance at all? [closed]
  17. java indexof(String str) method complexity [duplicate]
  18. A better algorithm to find the next palindrome of a number string
  19. Removing items from a collection in java while iterating over it
  20. Anagram algorithm in java
  21. Any implementation of Ordered Set in Java?
  22. JDK9 randomization on immutable sets and maps
  23. How do I get the intersection between two arrays as a new array?
  24. ‘MergeSort Algorithm’ – What’s the better implementation in JAVA? [closed]
  25. Generating shuffled range using a PRNG rather than shuffling
  26. Should I use composite primary keys or not?
  27. Finding the shortest path nodes with breadth first search
  28. Mergesort in java
  29. Random over ThreadLocalRandom
  30. Time complexity of System.arraycopy(…)?

Leave a Comment