常见排序算法示例.pptVIP

合并排序算法示意图 平滑排序 Smooth sort Smoothsort is a comparison-based sorting algorithm. It is a variation of heapsort developed by Edsger Dijkstra in 1981 Like heapsort, smoothsort builds up an implicit heap data structure in the array to be sorted, then sorts the array by continuously extracting the maximum element from that heap. Unlike heapsort, smoothsort does not use a binary heap, but rather a custom heap based on the Leonardo numbers L(n). The heap structure consists of a string of heaps, the sizes of which are all Leonardo numbers, and whose roots are stored in ascending order. The advantage of this custom heap over binary heaps is that if the sequence is already sorted, it takes only time to construct and deconstruct the heap, hence the better runtime. 平滑排序算法示意图 提要 插入排序Insertion sort 冒泡排序Bubble sort 鸡尾酒排序Cocktail sort 选择排序Selection sort 快速排序Quick sort 梳排序Comb sort 堆排序Heap sort 合并排序Merge sort 平滑排序Smooth sort 排序算法示例 提要 插入排序Insertion sort* 冒泡排序Bubble sort* 鸡尾酒排序Cocktail sort* 选择排序Selection sort* 快速排序Quick sort* 梳排序Comb sort* 堆排序Heap sort 合并排序Merge sort 平滑排序Smooth sort 插入排序 问题 扑克牌排序 考试卷排序 如何排序呢？ 63 12 22 51 5 19 2 37 [63] 12 22 51 5 19 2 37 [12 63] 22 51 5 19 2 37 [12 22 63] 51 5 19 2 37 [12 22 51 63] 5 19 2 37 [5 12 22 51 63] 19 2 37 [5 12 19 22 51 63] 2 37 [2 5 12 19 22 51 63] 37 [2 5 12 19 22 37 51 63] 插入排序(insertion sort) 不断拿到数据，且希望保持得到的数据始终是有序的 插入排序算法示意图 冒泡排序 思考 体育课上的从矮到高排队 学生座位按照序号进行排序就坐 如何排序呢？ 63 12 22 51 5 19 2 37 12 63 22 51 5 19 2 37 12 22 63 51 5 19 2 37 12 22 51 63 5 19 2 37 12 22 51 5 63 19 2 37 12 22 51 5 19 63 2 37 12 22 51 5