|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/most-fundamental-array-algorithms/
课程评论：没有评论
## 课程内容总结：最基础的数组算法 本课程面向所有有志于成为程序员的学习者，旨在深入解析一些最基础的算法，并通过从零开始的算法研发过程，揭示那些平时不易察觉的编程细节。掌握这些细节是成为自信程序员的必备条件。 课程的核心内容将围绕**数组（Array）**这一基本数据结构展开，它将是后续算法讲解的基础。 课程将重点介绍两种最常用的算法： 1. **Partitioning（分区）** 2. **Binary Search（二分查找）** 通过本课程，您将能够： * 清晰地理解这两种算法的每一个具体步骤。 * 可视化地观察算法在后台的实际运行过程。 * 通过提供的 Python 实现代码，在您自己的编程环境中进行测试和实践。 此外，课程还鼓励学习者在完成核心讲解后，**独立实现另一个广为人知的算法——QuickSort（快速排序）**，将其作为课程的实践项目。 **课程前提：** 学习者需要具备一个已配置好的 Python 编程环境，推荐使用 Anaconda 和 PyCharm，或者 Jupyter Notebook。
All aspiring programmers - this class will introduce you to the inner working of some of the most basic algorithms. Developing an algorithm from scratch reveals a whole lot of internal details that are otherwise not obvious. Programming is a lot about being able to handle these details. This class deals with simple and well-known algorithms that work on an array of numbers. The aim is to clearly visualize what goes on under the hood for these most basic algorithms. Knowing these details is a must to become a confident programmer.In order to start with this course, you need to have a Python programming environment ready. I suggest Anaconda with Pycharm. You may also do with Jupyter notebook. First it introduces a very basic data structure called Array. Then you will learn 2 most used algorithms namely Partitioning and Binary Search. You will be able to know exact steps of these algorithms and visualize the inner working. The implementation of these algorithms is given and you are encouraged to test them in your own Python programming environment.At the end, you are invited to implement another very well-known algorithm called QuickSort. This is your project after completing the lectures. Good luck!
