Question

c program algorithm to find the set of vertices making a regular 2D polygon

Answer 1

#include <iostream>

using namespace std;

int main () {

int sides;

cout << "how many sides the polygon has? :" ;

cin >> sides;

cout << "the number of vertices are equal the numbers of sides" << endl;

cout << sides;

return 0;

}

Answer 2

Sorry, but this is not specific enough. It's not clear what the program is supposed to do. What are the inputs? What are the outputs? What "set of vertices" need to be found for what polygon. There are infinite number of polygons. Do you want a set of (x, y) coordinates, or (x, y, z) that are in the same plane?

Again, it's really not clear what you're after.

It's also better if you post the problem (the task) description in details then your attempt to solve it (the code you wrote).