Chevron Left
返回到 Big-O Time Complexity in Python Code

學生對 Coursera Project Network 提供的 Big-O Time Complexity in Python Code 的評價和反饋

4.6
21 個評分
1 條評論

課程概述

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....
篩選依據:

1 - Big-O Time Complexity in Python Code 的 1 個評論(共 1 個)

創建者 Jorge G

2021年2月26日

I do not recommend taking this type of course, take one and pass it, however after a few days I have tried to review the material, and my surprise is that it asks me to pay again to be able to review the material. Of course coursera gives me a small discount for having already paid it previously. It is very easy to download the videos and difficult to get hold of the material, but with ingenuity it is possible. Then I recommend uploading them to YouTube and keeping them private for when they want to consult (they avoid legal problems and can share with friends), then they can request a refund.