[Coursera] Algorithms Part I

About this course: This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. ## Union−Find We illustrate our basic approach to developing and analyzing algorithms by considering the dynamic connectivity problem. We introduce the union−find data type and consider several implementations (quick find, quick union, weighted quick union, and weighted quick union with path compression). Finally, we apply the union−find data type to the percolation problem from physical chemistry. ## Analysis of Algorithms The basis of our approach for analyzing the performance of algorithms is the scientific method. We begin by performing computational experiments to measure the running times of our programs. W

关于本课程：本课程涵盖了每位严肃的程序员必须了解的算法与数据结构的基本信息，特别强调Java实现的应用及科学性能分析。第一部分涵盖基础数据结构、排序与搜索算法。第二部分则专注于图处理和字符串处理算法。## 并查集我们通过考虑动态连通性问题，阐述了我们的基本算法开发与分析方法。我们介绍了并查集数据类型，并探讨了多种实现方式（快速查找、快速合并、加权快速合并以及带路径压缩的加权快速合并）。最后，我们将并查集数据类型应用于物理化学中的渗透问题。## 算法分析我们分析算法性能的基础是科学方法。我们首先通过计算实验来测量我们程序的运行时间。