Write an Analyzer class which is passed a TimeList and a String telling which sort it is associated with.
The Analyzer should classify the running times as θ(n), θ(nlogn), θ(n^2), or something else and return
its classification as a String.
Append that String to a TextArea along with the the TimeList and the name of the sort, so the user can tell what's happening.
You will need to think about how to design your Analyzer to deal with the fact that θ is an approximation as n->∞!
Remember that the times for short runs are noisy and may be ignored; perhaps compare the times for the largest n and n/2 to decide what T(A(n)) is?