I have a question about clarifying my homework.
http://www.cs.bilkent.edu.tr/~gunduz/teaching/cs201/cs201_homework3.pdf
To see the handout, go to page 25 http://www.scribd.com/nanny24/d/36657378-Data-Structures-and-Algorithm-Analysis-in-C-Weiss .
Here is what I need to do, but I do not understand what this means. Does this mean that for algorithm 1, compare the actual operating time compared to (n ^ 3 + 3 * (n ^ 2) + 2 * n) / 6, n = array size? I don’t think so, but I couldn’t do anything. Could you explain to me what it is?
2- Plot the expected growth rates obtained from the theoretical analysis (as given for each solution) by
using the same N values that you used in obtaining your results. Compare the expected growth rates
and the obtained results, and discuss your observations in a paragraph.
EDIT 2:
Algorithm 1:
n actual running time(ms) (n^3 + 3*(n^2) + 2*n)/6 (I don't know whether the type is millisecond or not)
100 1 171700
1000 851 167167000
, , , , , (n ^ 3 + 3 * (n ^ 2) + 2 * n)/6 1. : http://www.diigo.com/item/image/2lxmz/m7y3?size=o
user1055645