程序代写代做代考 algorithm # Student README file
# Student README file
The average run time is the average of 3 different graphs of a given size $n$.
| n | Average Run Time of Nearest Neighbor (ms) | Average Run Time of Brute force (ms) |
| ——— | —- | —————- |
| 2 | 0 | 0 |
| 3 | 0 | 0 |
| 4 | 0 | 0 |
| 5 | 0 | 0 |
| 6 | 0 | 0 |
| 7 | 0 | 1 |
| 8 | 0 | 25 |
For small graph (n from 2 to 6), both algorithm runs in less than 1 ms. For larger graph (n=7, 8), nearest neighbor algorithms runs much faster than brute force.
