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.
Comparators
Loading...
Skills You'll Learn
Data Structure, Algorithms, Java Programming
Reviews
4.9 (9,820 ratings)
- 5 stars90.32%
- 4 stars8%
- 3 stars0.92%
- 2 stars0.23%
- 1 star0.50%
RP
Jun 10, 2017
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!
CS
Oct 26, 2021
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!
From the lesson
Mergesort
We study the mergesort algorithm and show that it guarantees to sort any array of n items with at most n lg n compares. We also consider a nonrecursive, bottom-up version. We prove that any compare-based sorting algorithm must make at least n lg n compares in the worst case. We discuss using different orderings for the objects that we are sorting and the related concept of stability.
Taught By
Kevin Wayne
Phillip Y. Goldman '86 University Lecturer
Robert Sedgewick
William O. Baker *39 Professor of Computer Science
Explore our Catalog
Join for free and get personalized recommendations, updates and offers.
Coursera Footer
© 2022 Coursera Inc. All rights reserved.
