|
@Serinth your referring to Big O Notation, I learned it it my first year java course at university. We laerned all about analysing algorithms, determining which ones ran more efficiently than others and why. O(n), O(logn), O(nlogn), O(n^2), O(n^3) is the notation for it. Not exactly fun stuff to pour through an algorithms and provide proofs as to why it runs O(n^2) or w/e, but it was interesting.
|