Big-O Time Complexity in Python Code

4.6

26 個評分

提供方

1,533 人已註冊

在此指導項目中,您將:
1 hour
中級
無需下載
分屏視頻
英語(English)
僅限桌面

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 Science

  • pyplot

  • Python Programming

  • Big-O

  • algorithm analysis

分步進行學習

在與您的工作區一起在分屏中播放的視頻中,您的授課教師將指導您完成每個步驟:

指導項目工作原理

您的工作空間就是瀏覽器中的雲桌面,無需下載

在分屏視頻中,您的授課教師會為您提供分步指導

審閱

來自BIG-O TIME COMPLEXITY IN PYTHON CODE的熱門評論

查看所有評論

常見問題