Resource này bao gồm:

  • welcome-to-the-course
  • what-why
  • measuring-algorithm-performance-time-complexity
  • big-o-notation
  • deriving-the-time-complexity-big-o-of-an-algorithm
  • constant-time
  • using-big-o-for-algorithm-comparison
  • a-first-task
  • solution-a-gotcha
  • about-this-course-outline
  • module-introduction
  • the-fibonacci-problem
  • the-fibonacci-solution
  • fibonacci-big-o-time-complexity
  • the-is-prime-problem
  • the-is-prime-solution
  • is-prime-improved-version
  • time-to-practice-problem
  • time-to-practice-solution
  •  identifying-big-o-quickly
  • s-power-of-two-algorithm
  • logarithmic-time-complexity
  • bitwise-operators-power-of-two
  • again-identifying-big-o-quickly
  • a-new-problem-solving-plan
  • the-change-making-problem
  • a-greedy-change-making-algorithm
  • a-variation-to-the-change-making-problem
  • course-roundup
  • code.zip
Bạn phải đăng nhập hoặc đăng ký để có thể xem nội dung này !

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses cookies to offer you a better browsing experience. By browsing this website, you agree to our use of cookies.