floating point input sequences are possible, i.e.:
.2 .4 .6 .8
Your goal is to find the shortest (smallest number of leaf nodes) possible sequence function that solves the problem.
Use the command line to input sequences to your program, i.e.:
bin00010% ./prog1 0 1 2 3 4 5 Shortest function is: N Next item is: 6 bin00010% ./prog1 3 4 5 Shortest function is: N + 3 Next item is: 6Be sure to include a Makefile, and include any special instructions for running your program by using a readme.txt file.
You are to turn in your code electronically by using the submit program on prime (i.e. machines in Stocker 307). To use to submit this first program:
~cs680/bin/submit prog1 *.h *.cc MakefileBe sure to limit any single submission to at most 20 files.
There is also an interactive version of the command:
~cs680/bin/submitOr for help:
/home/cs680/bin/submit -h
David M. Chelberg <chelberg@ohiou.edu> Last modified: Tue May 8 12:58:12 EDT 2012