Growth of run time as samples -> inf.

[Ted4P]

Generating random numbers: O(N)
Sorting numbers: O(N*log(N))
Evaluating the function: O(N) (Simpson's rule having a 2x larger constant factor)
Graphing: O(N) (Possibility of shrinking to O(1) with constant # of graphed samples)