- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Find number of diagonals in n sided convex polygon in C++

Suppose we have a number n, and we have to find the number of diagonals for n sided convex polygon. So if the n = 5, then diagonals count will be 5.

As this is n-sided convex polygon, from each vertex we can draw n – 3 diagonals leaving two sided adjacent vertices and itself. So for n vertices, it will be n*(n-3), but as we are considering twice, so it will be n(n – 3)/2.

## Example

#include<iostream> using namespace std; int diagonalCount(int n) { return n * (n - 3) / 2; } int main() { int n = 8; cout << n << " sided convex polygon has " << diagonalCount(n) << " diagonals"; }

## Output

8 sided convex polygon has 20 diagonals

- Related Articles
- Apothem of a n-sided regular polygon in C++
- Area of largest Circle inscribe in N-sided Regular polygon in C Program?
- Area of largest Circle inscribed in N-sided Regular polygon in C Program?
- Area of a n-sided regular polygon with given side length in C++
- Area of a n-sided regular polygon with given Radius in C Program?
- Determine the position of the third person on regular N sided polygon in C++?
- Area of a n-sided regular polygon with given Radius?
- How to find the number of diagonals of a polygon?
- Convex Polygon in C++
- Probability that the pieces of a broken stick form a n sided polygon in C++
- Determine the position of the third person on regular N sided polygon in C++ Program
- Checking for convex polygon in JavaScript
- Area of a polygon with given n ordered vertices in C++
- Find difference between sums of two diagonals in C++.
- Find the largest good number in the divisors of given number N in C++

Advertisements