title: Need help on determining the time complexity of a square grid
body: <p>So I am currently learning time complexity on my Data Structures class and I kind of got lost while doing an exercise. In the exercise I have a grid of 16 vertices so I have that <code>T(n)=T(16)</code>, so I would have that the total of edges equals 24. For the exercise I had to do a general formula for <code>T(n)</code>. The formula I used was <code>T(n)=[sqrt(n)*(sqrt(n)-1)]*2 = 2(n - sqrt(n))</code>. Now the part I got stuck is that the exercise  also asks me to prove that T(n) ϵ θ(n) by determining C1,C2 and n0. For that part I have done the following: <code>c1n &lt;= 2n - 2sqrt(n) &lt;= c2n</code>
                  *Dividing by n: *</p>
  
  <pre><code>c1 &lt;= 2 - 2/[sqrt(n)] &lt;= c2
  </code></pre>
  
  <p>However I do not know how to proceed from there or if this is even the correct aproach to answering that part of the exercise. Any help on how to proceed would be greatly apreciated. Thanks in advance.</p>