in the table, wherever stated f(n) = xxxx, it means the data in that line is T(n) /f(n)
T(n): seems to be increasing til infinity --> bound below loosely by a constant
f(n) = n: T(n)/n seems to be increasing to infinity --> it is bound below loosely by a line
f(n) = n^2: it is moving towards 0, although it did slows down but the trend is unlikely to reach a constant --> can say that it is bound above lightly by n2 although tighter than n^3
f(n) = n^3: seems to be decreasing too --> bound loosely above by a n^3 function
f(n) = nlog(n) seems to be the one with trend approaching a constant fastest ==> can say that T(n) grows similarly to a nlog(n) function
n T(n) f(n)=n*10^5 f(n)=nlog(n) f(n)=n^2*10^9 f(n)=log(n)*10^5 f(n)=n^3*10^6
Through these 2 tables, the data still show that the quicksort program still grows most similar with theta(nlog(n)) despite the differencce in the method of comparison: time measurement and counting number of swap function calls.