English subtitles

← Heap Sort Performance - Intro to Algorithms

Get Embed Code
3 Languages

Showing Revision 3 created 05/25/2016 by Udacity Robot.

  1. So what's the running time of this going to be?
  2. Is it (logn) like the other heap operations we've been looking at?
  3. Is it θ(n)?
  4. Is it θ(nlogn),
  5. which I had said most sorting can be done in (nlogn),
  6. but it's not clear if this actually achieves that.
  7. Or is it more like (n₂)?