Using Haskell:

centroid :: [(Double, Double)] -> (Double, Double)

Given a list of points, represented as integer pairs, return the centroid of the points. This will be a point where the x-coordinate is the average of all x-coordinates, and the y-coordinate is the average of all y-coordinates. You may assume that the list is non-empty. Project1> centroid [(0,0)] (0.0,0.0) Project1> centroid [(0,0),(2,2)] (1.0,1.0) Project1> centroid [(0,2),(2,0),(4,4)] (2.0,2.0)