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 1371 of 2109
Error functions using cmath in C++
We are given the variable and the task is to find the probability of the variable using an error function available in C++ STL. This function is available in the cmath header file in C++.What is an Error function?Error function in mathematics is also known as Gauss error function which is denoted by erf(). It is a special function that is used in probability, statistic and partial differential equations for the calculation of error that can occur. It is defined as −There are two closely related error function −complementary error function − It is defined as erfc x = 1 ...
Read Moreexp2() function in C++ STL
In this article we will be discussing the working, syntax and examples of std::exp2() function for complex numbers in C++ STL.What is std::exp2()?std::exp2() function for complex numbers is an inbuilt function in C++ STL, which is defined in or header file. exp2() function is used for computing the binary exponential function that is the base-2 exponential function of a given number.This function returns either double, float or long double value which is .Syntaxexp2(double n); exp2(float n); exp2(long double n);ParametersThe function accepts the following parameter(s) −n − It is a value of the exponent.Return valueThis function returns the base-2 ...
Read Morenearbyint() function in C++
In this article we will be discussing the working, syntax and examples of nearbyint() function in C++ STL.What is nearbyint()?nearbyint() function is an inbuilt function in C++ STL, which is defined in header file. nearbyint() function is used to get the round integral value as per the input.The function rounds off the input to get a nearest integral value, the round method is described by fegetround.This function accepts the float, double, and long double type values, as arguments.Syntaxdouble nearbyint(double num); float nearbyint(float num); long double nearbyint(long double num);ParametersThe function accepts following parameter(s) −num − The value which is to ...
Read Morescalbn() function in C++
In this article we will be discussing the working, syntax and examples of scalbn() function in C++ STL.What is scalbn()?scalbn() function is an inbuilt function in C++ STL, which is defined in the header file. scalbn() function is used to scale significantly using the floating point base exponent.Significand is a part of a floating-point number consisting of its significant digits, depending upon the interpretation of the exponent significand can be an integer or a fraction.The function calculates the product of num and FLT_RADIX to the power n, where FLT_RADIX is the base of all floating point data types and ...
Read Moremktime() function in C++ STL
In this article we will be discussing the working, syntax and examples of mktime() function in C++ STL.What is mktime()?mktime() function is an inbuilt function in C++ STL, which is defined in the header file. mktime() function is used to convert the local time to and object time_t.This function is like the reverse of the function localtime(), which converts an input to the local timezone of the machine.This function automatically modifies the values of the member timeptr if they are off the range or there is tm_day and tm_yday which are not allowed.Syntaxtime_t mktime( struct tm* tptr );ParametersThe function ...
Read Morequick_exit() function in C++ with Examples
In this article we will be discussing the working, syntax and examples of quick_exit() function in C++ STL.What is quick_exit()?quick_exit() function is an inbuilt function in C++ STL, which is defined in the header file. quick_exit() function is used to quickly terminate the calling process means it terminates the process without cleaning of its resources.This function is used for normal termination and no additional cleanup tasks are being performed like, no object destructors are called, whereas the C streams are closed or flushed, the files which are opened with tmpfile are being removed.When we terminate a process using quick_exit() ...
Read MoreQuickly merging two sorted arrays using std::merge() in C++ STL(cute ho ap)
In this article we will be discussing how we can quickly merge two sorted arrays using std::merge() function in C++ STL.So, before solving the problem let's first discuss the std::merge() in C++ STL.What is std::merge()?std::merge() function is an inbuilt function in C++ STL, which is defined in the header file. merge() is used to merge two sorted ranges or series. This function combines two sorted ranges to make one single sorted range. All the elements are compared using less than operator (
Read MorePlace N^2 numbers in matrix such that every row has an equal sum in C++
In this problem, we are given an integer value N. our task is to print numbers within the range (1, N2) in a 2D matrix of size NxN in such a way that the sum elements of each row are equal.Let’s take an example to understand the problem, Input − N = 4Output −1 6 11 16 2 7 12 13 3 8 9 14 4 5 10 15Sum of elements in each row is 34To solve this method, we need to place each element in the matrix in such a way that the total in each row is equal. ...
Read MorePlace K-knights such that they do not attack each other in C++
In this problem, we are given three integer value K, N, M. our task is to place K knights in an NxM chessboard such that no two knights attack each other. There can be cases with 0 valid ways and also cases with multiple valid ways. You need to print all valid cases.Knight is a chess piece that moves two moves ahead and then one move to the left of right. It can move in any direction in the chessboard.Attack is the position when one piece can be in the same place as other pieces in one chance of its ...
Read MorePlace k elements such that minimum distance is maximized in C++
In this problem, we are given an array of n points that lie on the same line. Our task is to place k elements of the array in such a way that the minimum distance between them is maximized.Let’s take an example to understand the problem, Input − array = {}Output −To solve this problem, we will find have to find the maximum possible minimum distance. For such a problem first, we need to sort the given array and then do a binary search until we get the solution at mid.ExampleProgram to show the implementation of our solution, #include ...
Read More