|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/data-structures-and-algorithms-x/
课程评论：没有评论
**课程名称：** 数据结构与算法 (C# 代码在 GitHub) **课程概述：** 本课程全面讲解基础及高级数据结构与算法，这是科技公司编码面试的核心内容。课程配套一个 C# GitHub 开源项目（GitHub 用户名：PiJei，仓库名：AlgorithmsAndDataStructures），其中每个算法都标注了其空间和时间复杂度 (Big O)，并使用与课程完全相同的示例进行正确性测试。 **目标学员：** * 准备大型科技公司（如 Google, Amazon, Facebook, Apple, Microsoft）或小型高科技公司编码面试的开发者。 * 希望一次性掌握核心及复杂数据结构与算法的开发者和研究生。 **学习特色：** * **深度学习：** 课程大量运用动画、示例和重复讲解，旨在帮助学员长期牢固掌握新知识。 * **实战演练：** 部分算法通过中等规模示例进行讲解，通过算法多次重复直至易于理解。 * **免费配套资源：** GitHub 开源项目提供算法实现和测试用例，方便学员实践和验证。 **课程内容 (45 讲，约 400 分钟)：** * **搜索算法：** * 线性搜索 * 哈希表搜索 * 跳跃搜索 * 指数搜索 * 斐波那契搜索 * 二分搜索 * 三分搜索 * 插值搜索 * **排序算法：** * 冒泡排序 * 插入排序 * 选择排序 * 快速排序 * 归并排序 * 基数排序 * 堆排序 * **二元堆：** * 最小二元堆 (Min Binary Heap) * 最大二元堆 (Max Binary Heap) * 最小-最大二元堆 (Min-Max Binary Heap) * **操作：** 构建、插入、删除 * **二叉树：** * 二叉搜索树 (Binary Search Tree) * AVL 树 (AVL Tree) * 红黑树 (Red-Black Tree) * **操作：** 插入、删除 * **N 叉树：** * B 树 (B Tree) * B+ 树 (B+ Tree) * **操作：** 插入、删除 **大纲：** 无
This course teaches a comprehensive list of basic and advanced data structures and algorithms, an essential topic of coding interviews at tech companies. The course is paired with a C# GitHub open source project (username: PiJei, repository name: AlgorithmsAndDataStructures) where each algorithm is tagged with its space and time complexities (Big O), and tested for correctness with the exact same examples used in this course. If you are a developer or a graduate student who is preparing for coding interviews at large tech firms as Google, Amazon, Facebook, Apple, Microsoft, or smaller high tech companies, you have landed in the right place. By attending this course you will learn the essential and complex data structures and algorithms, once and for all. Some algorithms are taught over a medium size example such that the algorithm repeats itself several times until it is no longer complex and rather easily understood. You are expected to maintain the knowledge gained via this course for a very long period of time. This is because this course makes heavy usage of animations , examples, and repetitions, which are the keys for deeply learning new topics. The course has 45 lectures (~ 400 minutes) covering the following topics: Search Algorithms: Linear SearchHash-Table SearchJump SearchExponential SearchFibonacci SearchBinary SearchTernary SearchInterpolation SearchSort Algorithms:Bubble SortInsertion SortSelection SortQuick SortMerge SortRadix SortHeap SortBinary Heaps:Min Binary HeapMax Binary HeapMin-Max Binary HeapWith these operations: Build Insert Delete Binary Trees:Binary Search TreeAVL TreeRedBlack TreeWith these operations:InsertDeleteNary Trees:B TreeB+ TreeWith these operations: a. Insert b. Delete
