|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/
课程评论：没有评论
**课程名称：** JavaScript 算法设计技术 **课程概述：** 本课程旨在教授学员如何设计高效且正确的算法。我们将从算法复杂度分析（时间与空间复杂度）入手，学习如何衡量算法的性能。 随后，课程将深入探讨**递归**及其在算法设计中的重要性，通过实际编码（JavaScript）解决如“汉诺塔”和“二叉树子树”等经典问题。 接着，我们将学习**回溯法**，这是一种增强的递归技术，允许在递归过程中撤销决策。学员将通过解决“老鼠走迷宫”、“N皇后”和“骑士周游”等问题来掌握回溯法的应用。 课程还将涵盖**分治算法**和**贪心算法**，重点在于理解、识别和解决相关经典问题。 最后，我们将深入学习**动态规划**，这不仅是算法设计的重要技术，更是面试中的热门考点。我们将通过大量编码练习来掌握动态规划的解题思路。 **课程目标：** * 掌握算法设计的基本原理。 * 通过大量 JavaScript 编码实践，提升解决实际问题的能力。 * 熟练运用算法复杂度分析来评估算法效率。 * 为准备编码面试和参与竞争性编程打下坚实基础。 **教学方式：** 课程将提供直播式的解题过程，并逐行代码展示，确保学员透彻理解。 **课程保障：** 提供30天无忧退款保证。
Algorithm Design Techniques: Live problem solving in Java ScriptAlgorithms are everywhere! One great algorithm applied sensibly can result into a System like GOOGLE! Larry Page, founder of google designed "Page Rank" algorithm that is behind the search in google. That is why when we search on google we generally find the most relevant result on the First Page itself.Every Computer Programmer should learn how to design algorithms which are not only correct but also efficient in terms of TIME and SPACE!Completer scientists have worked from 100s of years!! - (Put images of some of the scientists…)And derived some of the techniques that can be applied to write and design algorithms!So Why to reinvent the wheel ??Let's go through some of the most famous algorithm design techniques in this course!!Once you will come to know these design techniques It will become very easy for you to approach a problem by identifying which technique to apply to solve that correctly and efficiently.We will start this course with some measurement techniques in algorithms that is called complexity analysis so that we can measure -The time and space in an algorithm when we design that.Then we will start with understanding recursion and deep dive into that.Recursion is the base of any algorithm design … because most of the algorithms has to be solved using recursion!Recursion is executed in computers in a very special way using stack frames… we will understand all that..There are many types of recursion and we will have a look into that. We will solve some classic problems like the Tower of Hanoi, Binary subtree… to understand the recursion deeply… And WE WILL WRITE THE CODE LINE BY LINE IN JAVA!! To make it very easy to understand and code…Then we will move into another design technique backtracking!! Backtracking algorithms are enhanced recursion where we can revert our decision from inside a recursion…We will understand how to Identify and approach this kind of problems.. Also, we will solve some classical problems Rat In Maze, NQueens, KnightsTour problems… and Code them LINE by LINE …Then, We will then move to the next section Divide and Conquer… Greedy algorithmsAnd will take the same approach!! To understand identify and Solve some problems… and code some classic problems.Then there will be a very important section! Dynamic programming That is not only important for Algorithms design but also, InterviewsThis is a very favorite paradigm for the interviewer to ask questions from - We will solve a lot of problems in section along with code… and understand how to approach this kind of problem!!All in all!By the end of this course - 1. You will understand how to design algorithms 2. A lot of coding practice and design live problems in Java 3. Algorithm Complexity analysis AND If you are preparing for your coding Interview or doing competitive programming This course will be a Big help for you!I think this is enough to create the THRILL!! I welcome you to the course and I am sure this will be fun!!If it does not - It comes with a 30 Days money-back guarantee so don't think twice to give it a shot…Welcome Again!! And See you in the course.
