1. Project 2 Guidelines

2. Data Table For List size N= (fill in allocated list size) Kth Position
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4 1
n/4
n/2
3n/4 n
Should have 1 table for each size of list used.
Fill in average time it takes for each algorithm to find the corresponding location
Please indicate list size used above each table

3. Data Table For List size N= (fill in allocated list size) Kth Position
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4 1
n/4
n/2
3n/4 n
Should have 1 table for each size of list used.
Fill in average time it takes for each algorithm to find the corresponding location
Please indicate list size used above each table
Go up to the number you believe showcases your algorithm growth rates accurately.
Increments do not have to be small. Ex: increasing by 50 is good. (10,50,100,150,200…) or larger (10,50,100,200,600…).

4. Graph
Two Graphs (one with list size small ex(n=10) another with list size big ex(n=500).
Graph all four algorithms together on a Time vs position graph. Position being k=1,n/4,n/2,…

5. Test Strategies Explain how lists were formed
How many times each algorithm was tested for each slot
Was each algorithm ran together in a loop/ one by one
Thinking process to determine how to accurately test your algorithms

6. Explanation of Results
Why do algorithms behave like the way they do?
Which was worst performing? Why?
Which was best performing? Why?
Did results follow expectations?

7. Select 2 vs 3/ Select 1 / 4
Briefly iterate the differences in implementation
Give time complexities (with how those complexities are calculated via recurrence relation/ logic. Ex: 3 nested for loops = n^3)
Possible cases where one might perform better than the other/vice versa

8. Strengths/Constraints
What parts of your implementation could you have possibly done better(if there is any)?
Did computer hardware possibly affect data?
Running other programs as well?
What do you think was good about your design?
Bad?