std::uniform_int_distribution class in C++ Last Updated : 11 Jul, 2025 Summarize Comments Improve Suggest changes Share Like Article Like Report In Probability, Discrete Uniform Distribution Function refers to the distribution with constant probability for discrete values over a range and zero probability outside the range. The probability density function P(x) for uniform discrete distribution in interval [a, b] is constant for discrete values in the range [a, b] and zero otherwise. Mathematically the function is defined as: \[ f(x) = \begin{cases} \frac{1}{b-a}, & a\leq x \leq b\\ 0, & \text{otherwise}\\ \end{cases} \] C++ have introduced uniform_int_distribution class in the random library whose member function give random integer numbers or discrete values from a given input range with uniform probability.Public member functions in uniform_int_distribution class: operator(): This function returns a random number from the given range of distribution. The probability for any number to be obtained from this function is same. Operator() function takes constant time for generation. Example: CPP // C++ code to demonstrate the working of // operator() function #include <iostream> // for uniform_int_distribution function #include <random> using namespace std; int main() { // Here default_random_engine object // is used as source of randomness // We can give seed also to default_random_engine // if psuedorandom numbers are required default_random_engine generator; int a = 0, b = 9; // Initializing of uniform_int_distribution class uniform_int_distribution<int> distribution(a, b); // number of experiments const int num_of_exp = 10000; int n = b - a + 1; int p[n] = {}; for (int i = 0; i < num_of_exp; ++i) { // using operator() function // to give random values int number = distribution(generator); ++p[number-a]; } cout << "Expected probability: " << float(1) / float(n) << endl; cout << "uniform_int_distribution (" << a << ", " << b << ")" << endl; // Displaying the probability of each number // after generating values 10000 times. for (int i = 0; i < n; ++i) cout << a + i << ": " << (float)p[i] / (float)(num_of_exp) << endl; return 0; } Output: Expected probability: 0.1 uniform_int_distribution (0, 9) 0: 0.0993 1: 0.1007 2: 0.0998 3: 0.0958 4: 0.1001 5: 0.1049 6: 0.0989 7: 0.0963 8: 0.1026 9: 0.1016 We could observe from the output that the probability of each number obtained from the random number is much closer to calculated probability. a(): Returns the lower parameter of range. This specifies the lower bound of the range of values potentially returned by its member operator(). b(): Returns the higher parameter of range. This specifies the upper bound of the range of values potentially returned by its member operator(). max(): This function return the possible smallest upper bound of output possible from the operator() function. min(): This function return the possible highest lower bound of output possible from the operator() function. reset(): This function resets the distribution such that subsequent distributions are not dependent on the previously generated numbers. Example: CPP // C++ code to demonstrate the working of // a(), b(), min(), max(), reset() function #include <iostream> // for uniform_int_distribution function #include <random> using namespace std; int main() { int a = 10, b = 100; // Initializing of uniform_int_distribution class uniform_int_distribution<int> distribution(a, b); // Using a() and b() cout << "Lower Bound" << " " << distribution.a() << endl; cout << "Upper Bound" << " " << distribution.b() << endl; // Using min() and max() cout << "Minimum possible output" << " " << distribution.min() << endl; cout << "Maximum possible output" << " " << distribution.max() << endl; // Using reset() distribution.reset(); return 0; } Output: Lower Bound 10 Upper Bound 100 Minimum possible output 10 Maximum possible output 100 Reference: https://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html.html Comment More infoAdvertise with us Next Article DSA Tutorial - Learn Data Structures and Algorithms A AyushShukla8 Follow Improve Article Tags : Mathematical Randomized C++ Programs DSA cpp-class cpp-random +2 More Practice Tags : Mathematical Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 12 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read Linked List Data Structure A linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List: 2 min read Like