Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
Given a convex polygon with n vertices, we can divide it into several separated pieces, such that every piece is a triangle.
Given a convex polygon with n vertices, we can divide it into several separated pieces, such that every piece is a triangle. When n = 4, there are two different ways to divide the polygon; When n = 5, there are five different ways. Give an algorithm that decides how many ways we can divide a convex polygon with n vertices into triangles