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. All the features of this course are available for free. It does not offer a certificate upon completion.
Quick Union
Loading...
您將學習的技能
Data Structure, Algorithms, Java Programming
審閱
4.9（8,824 個評分）
2017年6月10日
Incredible learning experience. Every programmer in industry should take this course if only to dispel the idea that with the advent of cloud computing exponential algorithms can still ruin your day!
2016年12月1日
An amazing course which enables one to appreciate and analyze various algorithms used in various applications. Must take for anyone who wants to build a career in computer science or related fields.
從本節課中
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.
教學方
Kevin Wayne
Phillip Y. Goldman '86 Senior Lecturer
Robert Sedgewick
William O. Baker *39 Professor of Computer Science
探索我們的目錄
免費加入並獲得個性化推薦、更新和優惠。
Coursera Footer
© 2021 Coursera Inc.保留所有權利。
