|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/python-algorithms-masterclass/
课程评论：没有评论
Coursera 上的“Python 算法大师课”是一门面向所有希望有效解决复杂问题的开发者的基础课程。本课程将系统地教授各种算法问题，并用 Python 高效实现，以便您能立即将其应用于工作中。通过本课程，您将提升数学和计算思维相结合的能力，设计出性能更优的算法，甚至掌握分析算法性能以选择最优解决方案的技巧。“Python 算法大师课”是那些希望在现实世界中快速准确地解决问题的学习者的理想选择。 **课程要点：** 1. **涵盖广泛的主题：** 从基础的问题解决理念到高级算法，课程内容包罗万象。 2. **理论与实践结合：** 通过丰富的实践问题，同步学习理论知识并动手用 Python 实现，积累实践经验。 3. **算法性能分析：** 学习理解和分析算法的时间复杂度和空间复杂度，从而优化算法性能。 4. **难度循序渐进：** 课程难度从基础到高级逐步提升，挑战您的解决问题能力。 **课程主题包括：** * **问题解决导论：** 学习解决问题的基本概念、数据输入输出以及如何将解决策略编写成代码。 * **递归：** 掌握递归的基本思想，并高效解决欧几里得算法、考拉兹猜想、汉诺塔、排列、斐波那契数列等问题。 * **排序：** 学习各种排序算法的基础，并高效处理单词排序、坐标排序、中位数排除、判断字谜、冒泡排序、插入排序等问题。 * **顺序查找：** 学习顺序查找的基本概念，并用于定位元素、回文数、埃拉托斯特尼筛法、构建三角形等问题的解决。 * **二分查找：** 学习二分查找的基本概念，并解决定位元素、猜二十个问题游戏、波浪形序列、切割树等问题。 * **栈：** 学习栈的基本概念，并高效解决可见的火柴棒、后缀表达式运算与转化、堆叠序列等问题。 * **队列与堆：** 学习队列和双端队列的概念，并解决约瑟夫问题、改变中位数等问题。 * **哈希表：** 掌握哈希表的基本概念，并用于解决两数之和、罗马数字转换等问题。 * **分治法 1：** 学习分治法的基本思想，并高效解决整数幂、矩阵运算、四叉树等问题。 * **分治法 2：** 高效解决根据枢轴划分和排序列表等问题。 * **动态规划 1：** 学习动态规划的基本概念，并解决斐波那契数列、2xN 拼图、爬楼梯、化零为一、同时找到最优值和最优解等问题。 * **动态规划 2：** 高效解决二项式系数计算、三角形路径、最长公共子序列等问题。 * **贪心算法：** 学习贪心算法的基本概念，并解决硬币找零、会议室座位安排等问题。 * **DFS 和 BFS：** 学习深度优先搜索 (DFS) 和广度优先搜索 (BFS) 的基本概念，并解决岛屿数量、迷宫导航等问题。 * **回溯：** 学习回溯的基本概念，并使用回溯法解决 N 皇后等问题。 * **树：** 学习树和二叉树的基本概念，并解决二叉树的各种遍历、重建二叉树等问题。 * **图：** 学习图的基本概念，并解决并查集、最小高度树（使用 Kruskal 算法）等问题。 * **最短路径：** 学习 Dijkstra 和 Floyd 算法，并解决计算最短路径成本、所有对最短路径等问题。 * **背包问题：** 学习使用贪心策略和动态规划解决可分割背包问题。 * **计算复杂度：** 通过选择问题学习计算复杂度，理解 NP-Theory、NP-Complete 和 NP-Hard 问题的基本概念。
"Python Algorithms Masterclass" is a fundamental course for any developer who wants to solve complex problems effectively.In this course, you will systematically learn various algorithmic problems and how to implement them efficiently using Python so that you can apply them immediately in your work.Develop your ability to combine mathematical and computational thinking to design better performing algorithms, and even master how to analyze performance to choose the optimal solution!The "Python Algorithms Masterclass" course is the best choice for anyone who wants to learn how to solve problems quickly and accurately in the real world.In the "Python Algorithms Masterclass" course,(POINT 1) You will learn a variety of topics from basic concepts of problem-solving to advanced algorithms.(POINT 2) You will learn theory and practice simultaneously through various practical problems, and gain experience in implementing them yourself using Python.(POINT 3) You will learn how to understand and analyze the time complexity and space complexity of algorithms to improve their performance.(POINT 4) You will challenge yourself with difficult problems by gradually increasing the difficulty level from basic to advanced.Introduction to Problem-Solving: Learn the basic concept of problem-solving, how to input and output data, and write problem-solving strategies in code.Recursion: Learn the basic concept of recursion and efficiently solve problems such as Euclidean algorithm to find the greatest common divisor, Collatz conjecture, Tower of Hanoi, permutations, Fibonacci sequence, and more.Sort: Learn the basic concept of sorting algorithms and efficiently solve problems such as word sorting, coordinate sorting, median elimination, determining anagrams, bubble sorting, insertion sorting, and more.Sequential Search: Learn the basic concept of sequential search and efficiently solve problems such as locating elements, Palindrome numbers, Eratosthenes' sieve, building triangles, and more.Binary Search: Learn the basic concept of binary seacrch and efficiently solve problems such as locating elements, playing twenty questions game, the batonic sequence, cutting trees, and more.Stack: Learn the basic concept of a stack and efficiently solve problems such as visible sticks, postfix operations and transformations, stacked sequences, and more.Queue and Heap: Learn the concept of a queue and a deque and efficiently solve problems such as changing median, Josephus, and more.Hash Tables: Learn the basic concepts of a hash table and efficiently solve problems such as sums of two elements, Roman numeral conversion, and more.Divide-and-Conquer 1: Learn the basic concept of divide and conquer and efficiently solve problems involving power of integer and matrice, quadtree, and more.Divide-and-Conquer 2: Efficiently solve problems such as dividing and sorting a given list by a pivot.Dynamic Programming 1: Learn the basic concept of dynamic programming and efficiently solve problems such as Fibonacci numbers, 2 x N Tiling, stair climbing, making it 1, finding the optimal value and the optimal solution simultaneously, and more.Dynamic Programming 2: Efficiently solve problems such as how to compute binomial coefficients, paths on triangles, sequence of final common parts, and more.Greedy approach: Learn the basic concept of the greedy approach and efficiently solve problems such as coin exchange, room assignment, and more.DFS and BFS: Learn the basic concept of Depth-First Search and Breadth-First Search and efficiently solve problems such as a number of islands, maze navigation, and more.Backtracking: Learn the basic concept of backtracking and use backtracking to efficiently solve problems such as N-Queens, and more.Tree: Learn the basic concept of trees and binary trees and efficiently solve problems such as traversal of binary trees, reconstruction of binary trees, and more.Graph: Learn the basic concept of graphs and efficiently solve problems such as Union-Find and finding the minimum height tree using the Kruskal algorithm, and more.Shortest Paths: Learn the Daixtra and Floyd algorithms and efficiently solve problems such as finding the cost of the shortest path and finding the shortest path of all pairs.Knapsack Problem: Efficiently solve problems such as the divisible knapsack problem using Griddy strategies and dynamic programming.Computational Complexity: Learn computational complexity through the selection problem, and understand the basic concept of NP-Theory, NP-Complete, and NP-Hard problems.
