Homework 1
==========

    Stu Dent  
    CSC 301.01 2017F
    Prof. Rebelsky  
    Homework 1  

Manifest
--------

This assignment contains four parts.

* `REAMDE.md`, the file you are reading.
* `log.txt`, a log of the running times of various algorithms.
* `heap.scm`, my solution to problem 1
* `point-ordering.scm`, my solution to problem 2

Running the code
----------------

### Problem 1

* Load the program in DrRacket.
* Type `(heap-example)`, to have it build and print a heap.

### Problem 2

* Load the program in DrRacket.
* Type `(run-experiments N)` to run N experiments.

Observations
------------

I found that using the nearest point was generally the best approach.
As Skienna suggested, there are some outlying cases in which it turns
out to be a bad approach.  I think choosing random starting points will
help.  My approach of randomly selecting between the nearest few points
also seems to be a good alternative.

Citations
---------

I attended the mentor session on Monday night and got help from both mentors
and the various students here.

Sam answered a question about the sample inputs on Piazza.

An evening tutor whose name I forget helped me debug the code.  (Sunday night.)
