Problem:
Suppose an algorithm consists of two stages. The time complexity of Stage 1 is O(nlog2n) and that of Stage 2 is O(n2). By using the definition of Big-Oh, show that the overall time complexity is O(n2).
Additional Information:
This question is from Computer Science and it explains about using Big-Oh for computing the time complexity of given algorithm.