title: Time complexity of greedy algorithm
body: <p>Good morning,</p>
  
  <p>I'm trying to find a way to calulate time complexity (average and worst) of greedy algorithm. I know that final formula is: O(nlogn + n) which is O(nlogn). I will appreciate any suggestion/hints how I can calculate this.</p>
  
  <p>Regards</p>