Big-O Time Complexity in Python Code

4.6
stars

26 ratings

Offered By

1,531 already enrolled

In this Guided Project, you will:
1 hour
Intermediate
No download needed
Split-screen video
English
Desktop only

In the field of data science, the volumes of data can be enormous, hence the term Big Data. It is essential that algorithms operating on these data sets operate as efficiently as possible. One measure used is called Big-O time complexity. It is often expressed not in terms of clock time, but rather in terms of the size of the data it is operating on. For example, in terms of an array of size N, an algorithm may take N^2 operations to complete. Knowing how to calculate Big-O gives the developer another tool to make software as good as it can be and provides a means to communicate performance when reviewing code with others. In this course, you will analyze several algorithms to determine Big-O performance. You will learn how to visualize the performance using the graphing module pyplot. Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.

Skills you will develop

  • Data Science

  • pyplot

  • Python Programming

  • Big-O

  • algorithm analysis

Learn step-by-step

In a video that plays in a split-screen with your work area, your instructor will walk you through these steps:

How Guided Projects work

Your workspace is a cloud desktop right in your browser, no download required

In a split-screen video, your instructor guides you step-by-step

Reviews

TOP REVIEWS FROM BIG-O TIME COMPLEXITY IN PYTHON CODE

View all reviews

Frequently Asked Questions