Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

freeCodeCamp

Big O Notation - Full Course

via freeCodeCamp

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This introductory course explains Big O notation for analyzing algorithm time and space complexity. It uses binary search, merge sort, recursion, Fibonacci, and common complexity classes to illustrate the concepts.

Syllabus

) Intro.
) What Is Big O?.
) O(n^2) Explanation.
) O(n^3) Explanation.
) O(log n) Explanation Recursive.
) O(log n) Explanation Iterative.
) O(log n) What Is Binary Search?.
) O(log n) Coding Binary Search.
) O(n log n) Explanation.
) O(n log n) Coding Merge Sort.
) O(n log n) Merge Sort Complexity Deep Dive.
) O(2^n) Explanation With Fibonacci.
) O(n!) Explanation.
) Space Complexity & Common Mistakes.
) End.

Taught by

freeCodeCamp.org

Reviews

5.0 rating, based on 1 Class Central review

Start your review of Big O Notation - Full Course

  • Anonymous
    This course from freeCodeCamp is truly excellent! The concept of Big O Notation is one of the most fundamental concepts in computer science and is often complex, but this explanation makes it simple and easy to understand. The instructor explains the concepts clearly and sequentially, with practical examples that greatly helped me grasp how to analyze algorithm efficiency. I benefited immensely and now feel more confident in writing better and more efficient code. I highly recommend this course to anyone who wants to solidify their understanding of data structures and algorithms.

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.