Proof by induction of Recurrence Relation
<p>I am analyzing different ways to find the time complexities of algorithms, and am having a lot of difficulty trying to solve this specific recurrence relation by using a proof by induction.</p>

<p>My RR is:
   T(n) &lt;= 2T(n/2) + √n</p>

<p>I am assuming you would assume n and prove n-1? Can someone help me out.</p>