Computer Science A Question on Arrays


<p>Selection sort and insertion sort both have time complexity O(n^2).</p>

<p>I know they both have the same time efficiencies, but is time efficiency the same as time complexity?</p>

<p>Yes. Don't worry about the phrasing, Big O notation always refers to the same thing. Selection sort and Insertion sort are quadratic searches, they have an efficiency of O(n^2).</p>