Assignment 1: Counting collinear points

Starting from the base code provided here, implement the straightforward and improved methods for counting the number of distinct collinear triplets in a set of n points in the plane.

You are encouraged to work with a partner. Please write the names clearly at the top of the file.

If this is your first C assignment after Data Structures, you may want to spend some time re-familiarizing with C. The class website contains some useful links. I would also encourage you to take the time and go over the make and linux tutorials.

If you are a more advanced programmer, you are encouraged to do some extra credit work. Some suggestions:

• You can make it so that every time teh user presses a certain key, the points are re-initialized.
• you can store the triplets of collinear poinst and render them as line segments.

What to turn in: email me the zip file of your code. Make sure not to include any cluttr (object files, executables)----before you zip it run "make clean".