Python Question

Problem 1b collinear.py: Collinearity of many points [5 points]

Write a function collinear() that takes a list of pairs (tuples) as an argument, where each pair again represents a point on a plane. Your function should return True only if all points in the list are collinear, and False otherwise. If the list has less than three points (including none), you should trivially return True1 .

For credit, your answer in Problem 1b must reuse your function from Problem 1a.

Hint: If there are n points in the input list, it is sufficient that you check n ? 2 appropriately chosen triples of points (there are several ways to choose which triples).

Practice goal: An accumulation pattern with boolean and to evaluate a for all expression; you have to figure out what the range of that for all is (i.e., which triples of points to consider). Also, further practice in code reuse and modular programming