Given n points in the plane sorted by xcoordinates describe

Given n points in the plane, sorted by x-coordinates, describe an algorithm to construct a simple polygon whose vertices are those points. There may be many such polygons. Your algorithm needs to output any one and should run in O(n) time.

Solution

it defines about the convex hull algoritm .it is the algorithm which takes the vertices of the polygon as a co-ordinates in a plane.let us take the cartesian co-ordinates in a plane as a two arrays X[1....n]and Y[1....n].We will represtne the convex hull is a set of polygons n a plane so nothing is matter what we take the inital head and the final point .so that we will consier it as a circular linked list