博客给出《算法（第4版）》第1.3和2.1节作为推荐阅读内容。讲座介绍排序问题和Java的Comparable接口，研究选择排序、插入排序、希尔排序等基础排序方法，还提及数组洗牌算法，最后通过Graham扫描算法展示排序在计算凸包上的应用。
Suggested Readings. Section 1.3 and 2.1 in Algorithms, 4th edition.
Lecture: 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.
扫一扫
3万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
