Lexicographical order denotes the way the words are ordered in a list, based on alphabetical order according to their alphabets. For example − List of words: Harry Adam Sam Lexicographical order of words: Adam Harry Sam A program to sort elements in lexicographical order is as follows ... Read More

Complex numbers are numbers that are expressed as a+bi where i is an imaginary number and a and b are real numbers. Some examples on complex numbers are − 2+5i 3-9i 8+2i A program to add complex numbers by passing structure to a function is given as follows ... Read More

A structure is a collection of items of different data types. It is very useful in creating complex data structures with different data type records. A structure is defined with the struct keyword. An example of a structure is as follows − struct DistanceFI { int ... Read More

A vector is a dynamic array that can resize itself if an element is inserted or deleted. The vector elements are contained in a contiguous storage and the container handles the storage automatically. A program that implements vectors is given as follows − Example #include <iostream> #include <vector> #include ... Read More

Variable length arrays can have a size as required by the user i.e they can have a variable size. A program to implement variable length arrays in C++ is given as follows − Example Live Demo #include <iostream> #include <string> using namespace std; int main() { ... Read More

A parallel array is a structure that contains multiple arrays. Each of these arrays are of the same size and the array elements are related to each other. All the elements in a parallel array represent a common entity. An example of parallel arrays is as follows − employee_name ... Read More

In a computer system, the binary number is expressed in the binary numeral system while the octal number is in the octal numeral system. The binary number is in base 2 while the octal number is in base 8. Examples of binary numbers and their corresponding octal numbers are as ... Read More

In a computer system, the binary number is expressed in the binary numeral system while the octal number is in the octal numeral system. The binary number is in base 2 while the octal number is in base 8. Examples of binary numbers and their corresponding octal numbers are as ... Read More

The LU decomposition of a matrix produces a matrix as a product of its lower triangular matrix and upper triangular matrix. The LU in LU Decomposition of a matrix stands for Lower Upper. An example of LU Decomposition of a matrix is given below − Given matrix is: 1 ... Read More

Fisher-Yates algorithm generates a random permutation of the array elements i.e. it randomly shuffles all the elements of an array. All the permutations for the array are equally likely as the Fisher-Yates algorithm is unbiased. A program to implement the Fisher-Yates Algorithm for array shuffling in C++ is given as ... Read More

The Greatest Common Divisor (GCD) of two numbers is the largest number that divides both of them. For example: Let’s say we have two numbers that are 63 and 21. 63 = 7 * 3 * 3 21 = 7 * 3 So, the GCD of 63 and ... Read More

Complex numbers are numbers that are expressed as a+bi where i is an imaginary number and a and b are real numbers. Some examples on complex numbers are − 2+3i 5+9i 4+2i A program to perform complex number multiplication is as follows − Example Live Demo ... Read More

Any linear equation in one variable has the form aX + b = cX + d. Here the value of X is to be found, when the values of a, b, c, d are given. A program to solve a linear equation in one variable is as follows − Example ... Read More

A queue is an abstract data structure that contains a collection of elements. Queue implements the FIFO mechanism i.e the element that is inserted first is also deleted first. In other words, the least recently added element is removed first in a queue. A program that implements the queue using ... Read More

A queue is an abstract data structure that contains a collection of elements. Queue implements the FIFO mechanism i.e. the element that is inserted first is also deleted first. In other words, the least recently added element is removed first in a queue. A program that implements the queue using ... Read More