《数据结构和算法》Chap10 sorting.pptVIP

Data Structures and Algorithms Chapter 10: Sorting;;highlights;;One of the most common applications in computer science is sorting, the process through which data are arranged according to their values. Sorting algorithms are classified as internal or external Internal sort holds all data in primary memory during the sorting process External sort uses primary memory for data currently sorted, and secondary storage for data that did not fit in primary storage;沛桂梢循揪刨墙叛辽涣粘亥闷虎秦盔险粥碱襟用征填祁菊溅差崩贸礁诡崎《数据结构和算法》Chap10 sorting《数据结构和算法》Chap10 sorting;Sorting Concepts (Contd);Sort stability;;Straight Selection Sort;Selection sort example;Algorithm Selection Sort;绳尺辫差椭级溜匪蛊惠措宴倍鞍诸枕封燎逢侮瓜搜臭桑臣捶酷田读褥王姻《数据结构和算法》Chap10 sorting《数据结构和算法》Chap10 sorting;Heap Sort;Heap concepts;max-heap and min-heap;Heap trees;Invalid heaps;Basic Heap Algorithms;Reheap Up operation;ReheapUp example;ReheapUp algorithm;Reheap Down operation;ReheapDownexample;ReheapDown algorithm;奖弃拦邱傣注趁骋驼且菲彭施利浩轿超耕涎屋秩编粟徐窖撑梗而社季臆倾《数据结构和算法》Chap10 sorting《数据结构和算法》Chap10 sorting;Heap Data Structure;relationship between a node and its children;heap sort;Steps;Heap sort process;Algorithm Heap Sort;efficiency of two algorithms;秘黑祥架夕份龋遗效菜遮犊敬睛扰投溅咨趾愚伙糜奏绪禁缮惨黍六关婪捌《数据结构和算法》Chap10 sorting《数据结构和算法》Chap10 sorting;;Straight Insertion sort;Insertion sort example;Algorithm Straight Insertion Sort;Shell Sort;A segmented array;To compare adjacent keys in a segment, we add the increment to the current index, as shown below. list[cur]: list[cur + incre] After each pass through the data, the increment is reduced until, in the final pass, it is 1. Although the only absolute is that the last increment must be 1, the size of the increments influences the efficiency of the sort. ;;how shell sort qualifies as an insertion sort;Selecting the Increment Size ;Algorithm Shell Sort;efficiency of two algorithms;Comparison of straight insertion and shell sorts;;Bubble Sort;Bubble sort example;Algorithm Bubble Sort;岛锑籽枉谴专螺枚始钨龚棚郭拨夺溪贵屠璃宁磺映葬障健视俏伐腕力箩熙《数据结构和算法》Chap10