How to get a random element from a C++ container?

by

I posted this solution on a Google+ article where someone else referenced this. Posting it here, as this one is slightly better than others because it avoids bias by using std::uniform_int_distribution:

#include  <random>
#include  <iterator>

template<typename Iter, typename RandomGenerator>
Iter select_randomly(Iter start, Iter end, RandomGenerator& g) {
    std::uniform_int_distribution<> dis(0, std::distance(start, end) - 1);
    std::advance(start, dis(g));
    return start;
}

template<typename Iter>
Iter select_randomly(Iter start, Iter end) {
    static std::random_device rd;
    static std::mt19937 gen(rd());
    return select_randomly(start, end, gen);
}

Sample use is:

#include <vector>
using namespace std;

vector<int> foo;
/* .... */
int r = *select_randomly(foo.begin(), foo.end());

I ended up creating a gist with a better design following a similar approach.

More Related Contents:

  1. Where can I get a “useful” C++ binary search algorithm?
  2. std::transform() and toupper(), no matching function
  3. c++ sort keeping track of indices [duplicate]
  4. Reorder vector using a vector of indices [duplicate]
  5. How can I sort an STL map by value?
  6. How can std::make_heap be implemented while making at most 3N comparisons?
  7. What is the right approach when using STL container for median calculation?
  8. std::back_inserter for a std::set?
  9. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  10. Why there is no std::copy_if algorithm?
  11. stl ordering – strict weak ordering
  12. Order Statistic Tree in C++
  13. Insertion sort stops working after million input
  14. C++ – Find numbers between first and last negative numbers in Array
  15. Is std::vector so much slower than plain arrays?
  16. How do I erase an element from std::vector by index?
  17. Is list::size() really O(n)?
  18. Heterogeneous containers in C++
  19. Why use functors over functions?
  20. What’s faster, iterating an STL vector with vector::iterator or with at()?
  21. std::map, pointer to map key value, is this possible?
  22. Similar String algorithm
  23. Calculating the Amount of Combinations
  24. Capturing a time in milliseconds
  25. Better shading on BW display while rendering filled surfaces
  26. Performance of qsort vs std::sort?
  27. How does C++ STL unordered_map resolve collisions?
  28. How do I erase elements from STL containers?
  29. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  30. STL algorithms: Why no additional interface for containers (additional to iterator pairs)?

Leave a Comment