Time complexity will two O(n^2) algorithms take the same amount of time?
<p>I am having trouble fully understanding this question:</p>

<p>Two O(n<sup>2</sup>) algorithms will always take the same amount of time for a given vale of n. True or false? Explain.</p>

<p>I think the answer is false, because from my understanding, I think that the asymptotic time complexity only measures the two algorithms running at  O(n<sup>2</sup>) time, however one algorithm might take longer as perhaps it might have additional O(n) components to the algorithm. Like O(n<sup>2</sup>) vs (O(n<sup>2</sup>) + O(n)).</p>

<p>I am not sure if my logic is correct. Any help would be appreciated.</p>