Big-O Time Complexity in Python Code

4.5
13 个评分
提供方
Coursera Project Network
在此指导项目中,您将:

Use matplotlib Pyplot to produce a graph to visualize Big-O performance data.

Write and analyze the performance of a Bubble sort function.

Create a Binary Search function and perform Big-O analysis.

Clock1 hour
Intermediate中级
Cloud无需下载
Video分屏视频
Comment Dots英语(English)
Laptop仅限桌面

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.

您要培养的技能

Data SciencepyplotPython ProgrammingBig-Oalgorithm analysis

分步进行学习

在与您的工作区一起在分屏中播放的视频中,您的授课教师将指导您完成每个步骤:

  1. Use matplotlib’s Pyplot module to produce a graph to visualize Big-O performance data.

  2. Write a function that returns one element and analyze the Big-O time complexity.

  3. Write a Bubble sort function and analyze its performance.

  4. Implement a Linear Search of an Array and determine its Big-O.

  5. Create a Binary Search function and perform Big-O analysis.

指导项目工作原理

您的工作空间就是浏览器中的云桌面,无需下载

在分屏视频中,您的授课教师会为您提供分步指导

常见问题

常见问题

还有其他问题吗?请访问 学生帮助中心