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.
Shellsort
Loading...
Compétences que vous apprendrez
Data Structure, Algorithms, Java Programming
Avis
4.9 (9,810 évaluations)
- 5 stars90,33Â %
- 4 stars7,99Â %
- 3 stars0,92Â %
- 2 stars0,23Â %
- 1 star0,50Â %
CS
26 oct. 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!
BJ
2 juin 2018
Good contents and the logic of the whole course structure is very clear for a novice like me. The weekly homework is also awesome. Would recommend to anyone who wants to learn about computer science.
À partir de la leçon
Elementary Sorts
We introduce the sorting problem and Java's Comparable interface. We study two elementary sorting methods (selection sort and insertion sort) and a variation of one of them (shellsort). We also consider two algorithms for uniformly shuffling an array. We conclude with an application of sorting to computing the convex hull via the Graham scan algorithm.
Enseigné par
Kevin Wayne
Phillip Y. Goldman '86 University Lecturer
Robert Sedgewick
William O. Baker *39 Professor of Computer Science
Explorer notre catalogue
Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.
Coursera Footer
© 2022 Coursera Inc. Tous droits réservés.
