title: How do I prove or disprove that this function is Ω(n^1.5)?
body: <p>so I have this recursive function:
  T(n) = T(log(n)) + T(n-log(n)) + n</p>
  <p>I've tried many times solving it, but I just wasn't successful. (finding the Theta)
  Basically it's enough for me to prove or disprove if it's Omega of n^1,5 (Ω(n^1.5))</p>
  <p>Help will be appreciated, thanks in advance!</p>
  <blockquote>
  <p>tl;dr:</p>
  <p>given T(n) = T(log(n)) + T(n-log(n)) + n</p>
  <p>prove or disprove: T(n) = Ω(n^1.5)</p>
  </blockquote>