跳到主要内容
步芽

【极致中配】普林斯顿 算法（Sedgewick，Wayne）

普林斯顿 Sedgewick & Wayne 经典算法课，涵盖并查集、算法分析、排序、优先队列、符号表与平衡查找树，理论结合 Java 实现。

难度
难度 3/5 — 本科算法核心课，需一定编程基础，非入门也非研究生难度
适合人群
有 Java 基础、想系统掌握算法与数据结构的本科生或自学者
前置要求
Java 编程基础（课程实现全部使用 Java）、基础数据结构（了解数组、链表有帮助）、离散数学基础（分析增长阶与数学模型时需要）
课程规模
45 讲 · 1651播放
在 B 站免费观看 →就这门课提问 →排进我的学习路线

主题覆盖

并查集动态连通性算法分析增长阶栈与队列泛型与迭代器选择/插入/希尔排序归并排序快速排序优先队列与二叉堆符号表二叉查找树与红黑树

课程大纲（45 讲）

  1. P1 · Lecture 1: Algorithms and Data Structures | Programming and Problem-Solving with7 分钟
  2. P2 · Lecture 2: Quick Find & Quick Union algorithms | Introduction to the dynamic con7 分钟
  3. P3 · Lecture 3 : Quick-Find Algorithm |Step-by-Step Guide to Dynamic Connectivity|Fro7 分钟
  4. P4 · Lecture 4: Quick-Union Algorithm | Quick-Union vs Quick-Find|Better Approach to5 分钟
  5. P5 · Lecture 5: From Quick-Union to Weighted Quick-Union | Weighted Quick-Union Algor9 分钟
  6. P6 · Lecture 6: Solving Real-World Problems with Union-Find: Percolation, Monte Carlo6 分钟
  7. P7 · Lecture 7: Understanding Algorithm Performance Scientific Approach| Predicting A5 分钟
  8. P8 · Lecture 8: Practical Algorithm Analysis: From Code to Predictions | Brute Force6 分钟
  9. P9 · Lecture 9: Unlocking Algorithm Secrets: Master Mathematical Models for Ultimate9 分钟
  10. P10 · Lecture 10: Secrets of Algorithm Efficiency : Mathematical Models and Growth Rat11 分钟
  11. P11 · Lecture 11: Mastering Algorithm Performance, Efficiency, Choosing the Best Algor8 分钟
  12. P12 · Lecture 12: Measuring and Optimizing Memory in Programming | Primitives, Arrays5 分钟
  13. P13 · Lecture 13: From Theory to Practice: Implementing Stacks, Queues, and Bags | Bes12 分钟
  14. P14 · Lecture 14: Solve Stack Capacity Issues with Dynamic Resizing: A Complete Guide7 分钟
  15. P15 · Lecture 15: Queue Implementation Demystified: From Linked Lists to Resizing Arra3 分钟
  16. P16 · Lecture 16: Using Generics in Stack and Queue Implementations | Generics in Data6 分钟
  17. P17 · Lecture 17: Iteration in Java | Making Data Structures User-Friendly | Stacks, Q5 分钟
  18. P18 · Lecture 18: Power of Stacks and Queues: Advanced Applications in Java|Dijkstra's9 分钟
  19. P19 · Lecture 19: Sorting Algorithms in Java: Keys, Records, and Efficiency | Impleme10 分钟
  20. P20 · Lecture 20:Selection Sort Visual Guide and Java Implementation|Efficient Sorting5 分钟
  21. P21 · Lecture 21: Insertion Sort: Concept, Implementation, and Performance7 分钟
  22. P22 · Lecture 22: Shellsort Algorithm | Concept, Implementation, and Analysis9 分钟
  23. P23 · Lecture 23: Shuffling Algorithms | Techniques for Achieving Uniform Randomness|5 分钟
  24. P24 · Lecture 24: Convex Hull | Sorting Algorithms in Computational Geometry | Sorting9 分钟
  25. P25 · Lecture 25: Mergesort: Principles, Implementation, and Analysis18 分钟
  26. P26 · Lecture 26: Bottom-Up Mergesort: Efficient and Practical Iterative Sorting3 分钟
  27. P27 · Lecture 27: Unraveling Complexity in Sorting | From Theory to Practice | Optimal7 分钟
  28. P28 · Lecture 28: Comparator Interface: Sorting Data Your Way | Sorting Options with J5 分钟
  29. P29 · Lecture 29: Sorting Stability Explained: Real-World Examples and Applications |4 分钟
  30. P30 · Lecture 30: Quicksort: A Deep Dive into Sorting Efficiency| Comparative Analysis14 分钟
  31. P31 · Lecture 31: Solving the Selection Problem with Quicksort Partitioning| Practical5 分钟
  32. P32 · Lecture 32: Sorting with Many Duplicates: Quicksort and Three-Way Partitioning |9 分钟
  33. P33 · Lecture 33:System Sorting:Real-World Sorting Algorithms Enhancing Everyday Syste9 分钟
  34. P34 · Lecture 34: Priority Queues: Understanding, Implementing, Using, Applications, A9 分钟
  35. P35 · Lecture 35: Deep Dive into Binary Heaps: From Basics to Advanced Operations18 分钟
  36. P36 · Lecture 36: Understanding Heapsort: Efficient In-Place Sorting Algorithm10 分钟
  37. P37 · Lecture 37: Introduction to Symbol Tables and Their Implementations15 分钟
  38. P38 · Lecture 38: Elementary Symbol Table Implementations: Unordered Linked Lists & Bi6 分钟
  39. P39 · Lecture 39: Advanced Functionality of Ordered Symbol Tables Explained|From Basic4 分钟
  40. P40 · Lecture 40: Binary Search Trees: Efficient Symbol Tables and Algorithms15 分钟
  41. P41 · Lecture 41: Ordered Operations in BSTs| Find Min, Max, Floor, and Ceiling in No7 分钟
  42. P42 · Lecture 42: Deletion in BSTs: Handling Deletions Like a Pro| Deleting Key-Value7 分钟
  43. P43 · Lecture 43: Symbol Tables: Mastering 2-3 Trees and Red-Black Trees14 分钟
  44. P44 · Lecture 44: Red-Black Trees Reimagined: Left-Leaning BSTs for Efficient Symbol T27 分钟
  45. P45 · Lecture 45: Practical Applications of Red-Black Trees7 分钟

本课程卡由 AI 生成，可能存在误差，欢迎反馈。