/**********************************************************************
 *  readme template                                                   
 *  TSP Heuristics
 **********************************************************************/

Name:
PennKey:
Recitation:

Hours to complete assignment (optional):


/**********************************************************************
 *  Have you filled out the end-of-semester evaluation yet at
 *  https://docs.google.com/forms/d/1_OQm_rkEW6biwPD4bDkeq5_O1AKxOEMJHeuy8pK9BRU/viewform?usp=send_form
 **********************************************************************/



/**********************************************************************
 *  Explain how you implemented the nearest insertion heuristic.
 **********************************************************************/


/**********************************************************************
 *  Explain how you implemented the smallest insertion heuristic.
 *  It's sufficient to list only the differences between this
 *  heuristic and the nearest insertion heuristic.
 **********************************************************************/



/**********************************************************************
 *  Fill in the distances computed by your heuristics.                
 **********************************************************************/

data file          nearest neighbor     smallest increase      extra credit
-----------------------------------------------------------------------------
tsp10.txt              1566.1363             1655.7462
tsp100.txt
tsp1000.txt
usa13509.txt




/**********************************************************************
 *  Report the times and distances for nearest insertion and
 *  smallest insertion as reported by TSPTimer.java.
 *
 *  TSPTimer generates random points, so your times and distances
 *  will differ from your fellow students, even if the computers
 *  are the same.
 **********************************************************************/
                   nearest (Time)   nearest (dist)    smallest (time)   smallest (dist)
TSPTimer    1000
TSPTimer    2000
TSPTimer    4000
TSPTimer    8000
TSPTimer   16000
TSPTimer   32000
TSPTimer   64000
TSPTimer  128000





/**********************************************************************
 *  Explain why you repeated the first point at the end of the list
 **********************************************************************/


/**********************************************************************
 *  If you did the extra credit, explain your heuristic, and how
 *  you went about implementing it.
 **********************************************************************/



/**********************************************************************
 *  If you did the extra credit, give instructions here for 
 *  running it.
 **********************************************************************/



/**********************************************************************
 *  List whatever help (if any) that you received
 **********************************************************************/




/**********************************************************************
 *  Describe any serious problems you encountered.                    
 **********************************************************************/




/**********************************************************************
 *  List any other comments here. Feel free to provide any feedback   
 *  on how much you learned from doing the assignment, and whether    
 *  you enjoyed doing it.                                             
 **********************************************************************/