Got a YouTube account?

New: enable viewer-created translations and captions on your YouTube channel!

English subtitles

← Function Comparision - Intro to Algorithms

Get Embed Code
3 Languages

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

  1. N² kind of beats everything here. So it's Θ(n²). It's order of n², as well as order of n³.
  2. Okay. So basically (log n)⁷ beats 9n(log n)² and n²/³ beats (log n)⁷ and 9n(log n)² beats n²/³.
  3. I think it was the most dominant one. So let's see what the options were.
  4. Θ(n²), O(n²), and O(n³).
  5. I'm going to add a little like for n³, this is valid because the big O notation is an upper bound.
  6. >>Upper bound. Okay. >>Yup.