Program 2 - Phase 2

Some notes on phase 2 of program 2:

Due: 11:59:59 p.m. Tuesday

Submit again even if it is identical to the first version.

Please use the same file names as you did in your first submission, unless there is a valid reason to change the names.

This will allow me to reuse more of my existing scripts that compile and run your program.

Your program should not print the processor and speed as hard-coded values. Only print them if they represent the processor the program is currently being executed on.

The specifications of the processor that you used to gather data should be given in your paper describing your results.
If you want to leave the processor information in your code, you could put it into a procedure, and then simply not call that procedure.
On rucs, you can find processor info using cat /proc/cpuinfo

Please make sure that you follow the specifications for running your program (ie get algorithm from command line and read data from standard input).

It's okay to use global variables for measuring performance and doing counts.

It's easiest and most accurate to increment your global distance counter in the distance function itself.

If you already submitted a paper with your results, you will probably want to submit an expanded version.

Your paper should be a pdf file
To demonstrate the performance show the ratio of the times as you double the size:

an n^2 algorithm should increase by a factor of (2n)^2 / n^2 = 4
an n lg n algorithm should increase by a factor of 2n lg 2n / n lg n = 2(lg 2n / lg n) = 2((1+lg n) / lg n)

README.txt or README.md:

Please use correct name and case for your README file (specifically, README should be all upper case)
In your README, please be complete and concise
Examples:

Name: Your name

Requirements: eg minimum JDK version

Compile and Run:
   g++ -o close -std=c++11 -o close main.cpp
   ./close  both  < mydatafile

Compile and Run Phase 2 (if different):
   gnatmake foo
   ./foo  divide  < someotherdatafile

Status (Examples below):
   Phase 1: Perfect
   Phase 2: Perfect

   Phase 1: BF works, DC works in some cases
   Phase 2: Perfect
            
   Phase 1: BF works, DC not implemented
   Phase 2: Perfect

Overall Performance (Your best estimate.  Examples below):
   Phase 1: BF and DC both n^2
   Phase 2: BF n^2.  DC n lg n

Sources and Acknowledgements:
   What resources did you use and where or from whom did you get help? 

Other comments: 
   Anything else that you want to say or want me to know.
   This part does not need to be concise.