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
Server Side Programming Articles
Page 1521 of 2109
Parsing a comma-delimited std::string in C++
In this article, we will discuss all the approaches to parse a string delimited by comma using a C/C++ program. First of all, let's understand the problem statement. The input of this problem is a string containing multiple words that are seperated by commas. Our task is to print each word space seperated to the output console. For example: // Input String "Hello, World, From, 2025" // Output "Hello" "World" "From" "2025" Parse Comma Delimited String Here is the list of approaches to parse comma delimited string to words using c++ program, which we ...
Read MoreC++ Program to Implement Euler Theorem
Euler's theorem states that if two numbers (a and n), are co-prime i.e. gcd(a, n)=1, then 'a' raised to the power of Euler's totient function of n (a^φ(n)) is congruent to 1 modulo n i.e. a^φ(n) ≡ 1 (mod n). The Euler's Totient Function is denoted as φ(n) and represents the count of integers from 1 to n that are relatively co-prime to n. In this article, we have two co-prime integers. Our task is to implement the Euler Theorem in C++ using given co-prime numbers. Here is an example to verify the Euler Theorem for two co-prime numbers: ...
Read MoreC++ Program to Implement Fermat’s Little Theorem
Fermat's Little Theorem states that if p is a prime number and a is an integer not divisible by p, then a^(p-1) is congruent to 1 modulo p. It can be represented as a(p-1) ≡ 1 (mod p). It can also be said that if any integer a is raised to the (p-1) where p is a prime and gcd(a, p) =1, then a^(p-1)-1 is divisible by p. In this article, we have two integers i.e. 'a' and a prime number 'p' such that a is not divisible by p. Our task is to implement Fermat's Little theorem using these ...
Read MoreC++ Program to Implement Park-Miller Random Number Generation Algorithm
The Park-Miller algorithm is a type of linear congruential generator (LCG) that is used to generate pseudo-random numbers. It is also called the minimal standard random number generator. The general formula of a random number generator (RNG) of this type is: X_{k+1} = g X(k) mod n where the modulus n is a prime number or a power of a prime number, the multiplier g is an element of high multiplicative order modulo n, and the seed X0 is co-prime to n. In this article, we will be using Park-Miller algorithm to generate 5 pseudo-random numbers using C++. Here is ...
Read MoreHow to concatenate a std::string and an int in C++?
Concatenate a string and an integer means, convert both the string and integer to a single string. In this article we will discuss all the approches to concatenate a std:string and an integer type using C/C++ program. First of all, let's understand the problem statement. We are given a standard c++ string and an integer. We have to output a single string by combining the given string and integer. For example: // Input String and Integer "Value = " 25 // Output String "Value = 25" Concatenate String and Int in C++ Here is the list ...
Read MoreHow to concatenate multiple C++ strings on one line?
Sting Concatenatination is the process of creating a single string from multiple strings by combining them all together. In this article, we will discuss all approaches to concatenate multiple strings using C/C++ program. First of all, let's understand the problem statement. A set of C++ strings are given as input. We need to output a single string which is concatenate of the strings provided. For example: // Input Strings "Value " "is " "Big" // Output String "Value is Big" Concatenate Multiple Strings to Single Line Here is the list of approaches ...
Read MoreC++ Program to Implement Russian Peasant Multiplication
The Russian Peasant multiplication is used to multiply two numbers without using the multiplication operator. It involves constant use of halving and doubling the numbers. In this article, we have two integers, our task is to find the product of these two integers by implementing russian peasant multiplication in C++. Steps to Implement Russian Peasant Multiplication We will follow these simple steps to find the product using Russian Peasant multiplication: We have created a function russianPeasant() that accepts both the numbers (n and m) as arguments. Then we used a ...
Read MoreVariable initialization in C++
In C++, variables are name given by the user to store data. While datatype is used to declare and initialize a variable that allocates memory to that variable. There are various ways to initialize the data types such as int, char, float, etc. to allocate the memory to that variable. Syntax Following is the syntax of variable initialization in C++: datatype variable_name = value; Here, datatype : The datatype of variables like int, char, float, etc. variable_name : This is the name of variable given by user. value : Any value to initialize the variable. By default, it ...
Read MoreC++ Program to Generate Random Numbers Using Probability Distribution Function
The probability density function (pdf) is a function that describes the relative likelihood for this random variable to take on a given value. It is also called as density of a continuous random variable. The probability of the random variable fall within a particular range of values is given by the integral of this variable's density over that range, So, it is given by the area under the density function but above the horizontal axis and between the lowest and greatest values of the range. Probability Distribution is based upon this probability density function. In this article, we will generate ...
Read MoreC++ Program to Generate Random Numbers Using Middle Square Method
The middle-square method is one of the simplest methods of generating random numbers. This method will either begin repeatedly generating the same number or cycle to a previous number in the sequence and loop indefinitely. For a generator of n-digit random numbers, the period can be no longer than the specified n(number of digits). If the middle n digits are all zeroes, the generator then generates zeroes forever. In this article, we will implement a C++ program to generate ten 4-digits random number using the middle-square method. Steps for Middle-Square Random Number Generation The steps for generating random numbers ...
Read More