C++ Articles

Page 200 of 597

partition_point in C++

Ayush Gupta
Ayush Gupta
Updated on 11-Mar-2026 174 Views

In this tutorial, we will be discussing a program to understand partition_point in C++.Partition point is a method which returns an iterator pointing to the first value in a given range. The range is a partitioned one in which the predicate is not true.Example#include #include #include bool IsOdd(int i) { return (i % 2) == 1; } int main(){    std::vector data{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };    std::vector odd, even;    std::stable_partition(data.begin(), data.end(), IsOdd);    auto it = std::partition_point(data.begin(), data.end(),    IsOdd);    odd.assign(data.begin(), it);    even.assign(it, data.end());    std::cout

Read More

Program to find area of a Circular Segment in C++

Ayush Gupta
Ayush Gupta
Updated on 11-Mar-2026 287 Views

In this tutorial, we will be discussing a program to find area of a circular segment.Making a chord in a given sphere divides it into two segments - major and minor. Given the radius of the circle and angle making the minor segment, we are required to find the areas of both segments.Example#include using namespace std; float pi = 3.14159; //finding area of segment float area_of_segment(float radius, float angle){    float area_of_sector = pi * (radius * radius)*(angle / 360);    float area_of_triangle = (float)1 / 2 *(radius * radius) *     sin((angle * pi) / ...

Read More

Program to find century for a year in C++

Ayush Gupta
Ayush Gupta
Updated on 11-Mar-2026 732 Views

In this tutorial, we will be discussing a program to find the century for a year.For this we will be provided with a year. Our task is to find the century in which the given year falls.Example#include using namespace std; void find_century(int year){    //year values can only be positive    if (year

Read More

Program to find Circumcenter of a Triangle in C++

Ayush Gupta
Ayush Gupta
Updated on 11-Mar-2026 675 Views

In this tutorial, we will be discussing a program to find the circumcenter of a triangle.For this we will be provided with three noncollinear points. Our task is to find the circumcenter of the triangle formed by those points.Example#include #include using namespace std; //storing X and Y values #define pdd pair void lineFromPoints(pdd P, pdd Q, double &a, double &b, double &c){    a = Q.second - P.second;    b = P.first - Q.first;    c = a*(P.first)+ b*(P.second); } void perpendicularBisectorFromLine(pdd P, pdd Q, double &a, double &b, double &c){    pdd mid_point = make_pair((P.first + Q.first)/2, ...

Read More

map rbegin() function in C++ STL

Sunidhi Bansal
Sunidhi Bansal
Updated on 11-Mar-2026 264 Views

In this article we will be discussing the working, syntax and examples of map::rbegin() function in C++ STL.What is a Map in C++ STL?Maps are the associative container, which facilitates to store the elements formed by a combination of key value and mapped value in a specific order. In a map container the data is internally always sorted with the help of its associated keys. The values in the map container are accessed by its unique keys.What is a map::rbegin()?map::rbegin() function is an inbuilt function in C++ STL, which is defined in  header file. rbegin() implies reverse begin function, this ...

Read More

Powers of two and subsequences in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 279 Views

In this problem, we are given an array of N integers. Our task is to find the count of subsequences that can be formed such that if their elements are multiplied, they result in a number which is a power of two.Let’s take an example to understand the problem, Input − arr = [2, 5, 4]Output − 3Explanation − subsequences [2], [4] and [2, 4] give the desired result.To solve this problem, we need to understand the logic of power.Only those numbers with are powers of 2 will multiply to give the desired result. So, we have to consider only ...

Read More

Power Set in Lexicographic order in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 833 Views

In this problem, we are given string str. Our task is to print the power set of this string’s elements in lexicographical order.Power Set − The power set of a set is the set of all subsets of the set. Denoted by P(S) where s is the set.Example −S = {1, 2, 3} ; p(S) = {{}, {1}, {1, 2}, {1, 3}, {2}, {2, 3}, {3}, {1, 2, 3}}In this problem, we will treat the string as a set. So, its characters will be the elements of the set.Let’s take an example to understand the problemInput − str = “xyz”Output ...

Read More

Power in Mathematics in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 229 Views

The power of a number is the times a number is multiplied to itself. Also knows as exponent or indices.a to the power b is b times a is multiplied by itself b times. 7 to the power 2 is 72 also known as 7 square is valued 49.Some common power values are −A number to the power 0 gives 1.A number to the power 1 gives the same number, as stated some multiplied once is the same.A number to the negative power is n times division. Example, a -3 = 1/a3 or (1/a)*(1/a)*(1/a)Now, let’s do some programming based on ...

Read More

Postorder traversal of Binary Tree without recursion and without stack in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 525 Views

In this problem, we are given a Binary tree. Our task is to print the postorder traversal of the binary tree without using recursion and without stack.Binary tree is a special type of tree in which each node can have at max 2 child nodes.Postorder Traversal is a tree traversal technique, in which the first left subtree is traversed than the right subtree and the root is traversed at the end.postorder traversal of the above tree − 8 4 2 7 9 6To traverse the tree without using recursion and stack. We will depth-first search based technique and data will ...

Read More

Postorder successor of a Node in Binary Tree in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 817 Views

In this problem, we are given a binary tree and node. Our task is to print the postorder successor of the node in Binary tree.Binary tree is a special type of tree in which each node can have at max 2 child nodes.Postorder Traversal is a tree traversal technique, in which the first left subtree is traversed than the right subtree and the root is traversed at the end.postorder traversal of the above tree: 8 4 2 7 9 6Let’s take an example to understand the problem.Input − binary tree in above example, node= 7Output − 9Explanation − we can ...

Read More
Showing 1991–2000 of 5,962 articles
« Prev 1 198 199 200 201 202 597 Next »
Advertisements