|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/algorithms-complexity/
课程评论：没有评论
课程名称：完整算法复杂性和大O表示法课程 概述：为了编写高效的代码，每位开发者都需要了解如何评估算法的复杂性。课程“算法复杂性评估与大O表示法”以简单易懂的语言解释了算法复杂性的数学原理，涵盖了复杂性的几种情况、递归复杂性、字符串处理、摊销分析和空间复杂性。此外，课程中还解决了15个示例，其中一些来自于谷歌、Facebook和亚马逊的面试题。我们对许多书籍和文章进行了重新整理，使其以最有效的方式呈现，以便于理解。因此，这门课程的内容是独立的，不需要学习任何额外的材料！只需基本的编程技能即可理解课程内容！重要提示：您可以随时暂停视频，详细处理材料的每个方面！
To develop effective code, each developer needs to know how to evaluate the complexity of the algorithms.The course "Big O Notation. Algorithms Complexity Evaluation." in simple language explains the mathematics behind the complexity of algorithms, cases of complexity, the complexity of recursion, strings, amortized analysis and space complexity. In addition we solve 15 examples, some of which are found in interviews on Google, Facebook, Amazon.We have reworked many books and articles to the most effective for perception and understanding form. As a result this course is independent by its nature and does not require studying of any additional materials. Basic programming skills is the only requirement to understand the course!Important note: you can always pause the video and process into every aspect of the material in detail!
