1. Project report
cs331

2. Must have a COVER PAGE
Label all sections according to the cover page.
Staple in the order of the cover page.

3. SECTION 1 – data Set Data sets
Tables – recording all times and find the average.
Graphs – Graph all algorithms on one graph. label x, y axis with units included.
Briefly explain your data set. Ex: tables compare algorthms with size of matrix for ex. Total of N tables….

4. Testing Strategy How did you find your data? Did everything in loop?
What time unit used? Why?
When testing, did you use uniform test data for all algorithms, or different for each?
Note:
Don’t run tests concurrently. Can result in one test’s resource consumption disproportionately affecting the runtime of another .

5. Explanation of Results
Does your graph match the algorithms theoretical growth rate. Why? Why not? Explain your implementation that could affect your results.
Explain through implementation.

6. Theoretical Comparison
Talk about how each algorithm has its theoretical complexity.
Ex: classical matrix uses 3 for loops…O(n^3). How does the nested for loops result in a theoretical complexity O(n^3).

7. Comparing algorithms
Difference between two algorithms. (implementation). Compare best, and worst cases. Which one performs better if the data set is larger/smaller? Explain why you think this way. s

8. Strengths /Constraints
What do you think you did well on?
Do you think your machine affected your results?
What could you have improved?
Any possible problems while implementing a solution?
Etc. …