Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
C++ Articles
Page 336 of 597
C++ Program to Generate Random Numbers Using Multiply with Carry Method
The multiply-with-carry method is a variant of the add-with-carry generator introduced by Marsaglia and Zaman (1991). The main advantages of this method are that it invokes simple computer integer arithmetic and leads to a very fast generation of sequences of random numbers with immense periods, ranging from around 260 to 22000000. In this article, our task is to generate random numbers using the multiply-with-carry method. Here is the formula of multiply-with-carry method: Multiply With Carry (MWC) Formula The multiply-with-carry formula is as follows: Xn = (a * Xn-1 + Cn-1) mod 232 Cn = (a * Xn-1 + Cn-1) ...
Read MoreWhat is the difference between cerr and cout streams in c++?
cout is an object of the stdout stream, while cerr is an object of the stderr stream.stdout and stderr are different streams, even though they both refer to console output by default. Redirecting (piping) one of them (e.g., program.exe >out.txt) would not affect the other. These are both provided by the library in C++. In this article, we will learn the difference between these two output streams in more detail. Character Output Stream (cout) The character output stream is used to display the data or information to the console (standard output device, basically the screen), like printing messages, results, ...
Read MoreC++ Program to Perform Edge Coloring to the Line Graph of an Input Graph
Edge coloring is a method of coloring the edges of a graph, such that no two edges having a common vertex is colored with same color. A line Graph is a special type of graph which help us to assume an edge-coloring problem into a vertex-coloring problem. In other words, using a line graph makes edge coloring easier. In this article, we will discuss how to perform edge coloring of a graph using line graph and greedy coloring approach. What is Line Graph? Line graph is a special graph that is created from another graph. In the line ...
Read MoreC++ Program to Perform Graph Coloring on Bipartite Graphs
Graph coloring is a technique in which, we assign colors to the vertices of a graph such that no two adjacent vertices have same color. Bipartite graph a special kind of graph which is possible to color by just two colors. In this article, we will discuss how to perform graph coloring on a bipartite graph using BFS algorithm. What is Bipartite Graph? Bipartite graph is special graph where you can divide the vertices into two sets, such that no two vertices of the same set are connected. This is why, it's possible to color a bipartite graph by ...
Read MoreHow to calculate Execution Time of a Code Snippet in C++?
To calculate the execution time of a program, use the std::chrono library, which was introduced in C++11. This library has two distinct objects: time_point and duration. The time_point represents the variable names that store the start and end times of specific algorithms, functions, or loops used in the program. While duration represents the interval between two different times. The chrono library allows us to subtract these time intervals. Here, we use the high_resolution_clock::now() function, which provides accurate units of time. Calculate the Execution Time of a C++ Program To get the execution time of a program use the chrono header ...
Read MoreWhy are global variables bad in C/C++?
Global variables are declared and defined outside any function in the program. They hold their values throughout the lifetime of the program and are accessible throughout its execution. When we use our non-constant global variable in our programs, it becomes harder to manage. So, it is better to use local variables because of specific functions and easier understanding. You can use the prefix g_ for global variable names to avoid naming conflicts and to indicate that the variable is global. There is another way to encapsulate the global variable by defining the variable static. Therefore, these are the reasons behind ...
Read MoreHow to append a vector in a vector in C++?
In C++, a vector is like a array which can be used accordingly. If you want to combine (append) two vectors, you need to add all the elements of one vector to the end of another. This is called appending a vector in a vector. To append a vector in a vector can simply be done by vector insert() method and moreover by using loops and std::move() to transfer elements. There are different ways to append one vector into another in C++. The most common ones are: Using insert() method Using ...
Read MoreC++ Program to Add Complex Numbers by Passing Structure to a Function
Complex numbers are numbers that are expressed as a+bi, where i is an imaginary number and a and b, are real numbers. Some of the example of complex numbers are 2 + 5i, 3 - 9i, 8 + 2i, etc. How to add complex number? Here, we will explain how to add two complex numbers. Let us assume we have two complex numbers, Z1 and Z2. // a and b are the real and imaginary parts of Z1 Z1 = a + bi // c and d are the real and imaginary parts of Z2 Z2 = c + ...
Read MoreHow to calculate combination and permutation in C++?
Combination and permutation are a part of combinatorics. The permutation is known as the different arrangements that a set of elements can make if the elements are taken one at a time, some at a time, or all at a time. Combination is the different ways of selecting elements if the elements are taken one at a time, some at a time, or all at a time. In this article, we have the value of 'n' and 'r' such that 'r' should be less than n. Our task is the find the permutation and combination using the value of 'n' ...
Read MoreWhich is the fastest algorithm to find prime numbers using C++?
The fastest algorithm to find the prime numbers is the Sieve of Eratosthenes algorithm. It is one of the most efficient ways to find the prime numbers smaller than n when n is smaller than around 10 million. In this article, we have a given number as 'num'. Our task is to find all the prime numbers less than or equal to num using Sieve of Eratosthenes algorithm in C++. Example Here is an example to find prime numbers less than 10: Input: num = 10 Output: 2 3 5 7 The explanation of the above ...
Read More