种排序算法总结（Summary of sorting algorithms）.docVIP

10种排序算法总结（Summary of 10 sorting algorithms） Summary of 10 sorting algorithms There are many sorting algorithms, so it is important to use which algorithm in a particular scenario. In order to select the appropriate algorithm, the following criteria can be considered in the order in which the recommendations are made: (1) execution time (2) storage space (3) programming For a small amount of data, (1) (2) little difference, mainly consider (3); and for large amount of data, (1) as the primary. The main sorting method is: First, bubble (Bubble) sorting - adjacent exchange Two, selection sort -- each row in the position corresponding to the minimum Three, insert sort - insert the next one into the already arranged sequence Four, shell (Shell) sort - reduce increments Five, merge sort Six, quick sort Seven, heap sort Eight. Topological sorting Nine. Tournament sorting Ten, radix sort First, bubble (Bubble) sort ----------------------------------Code n the number of ------------------------------------ ascending order Void BubbleSortArray () { For (int i=1; in; i++) { For (int j=0; In-I; j++) { If (a[j]a[j+1]) compares and exchanges adjacent elements { Int temp; Temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } } } ------------------------------------------------- code ------------------------------------------------ 效率 o (n2), 适用于排序小列表. 二、选择排序 ---------------------------------- code 从小到大排序n个数 -------------------------------- selectsortarray (void) { int min _ index; for (int i = 0; in - 1; i + +) { what _ index = i; for (int j = i + 1; jn; j + +) 每次扫描选择最小项 if (arr arr [j], [], _ min min _ index) index = j; if (min _ index. 找到最小项交换, 即将这一项移到列表中的正确位置 = i) { int temp; temp = arr [i]; arr arr [i] = [min _ index]; arr [index] = min _ temp; } } } ------------------------------------------------- code ----------------------------------------- 效率o (n2), 适用于排序小的列表. 三、插入排序 -------------------------------------------- code 从小到大排序n个数 ------------------------------------- insertsortarray (voi