10排序方法（10 sorting method）.docVIP

10排序方法（10 sorting method） Summary of 10 sorting algorithms 2011-09-20 12:01:17, let me say a couple of collections. I want to contribute [font: small, big] There are many sorting algorithms, so its important to use an algorithm in a particular situation. In order to select the appropriate algorithm, the following criteria can be considered in the recommended order: (1) execution time (2) storage space (3) programming For a small amount of data, (1) (2) little difference, the main consideration (3); and for large amounts of data, (1) as the primary. The main sorting method is: One, bubble (Bubble) sort - adjacent exchange Two, selection sort -- each minimum / long at the corresponding position Three, insert sorting - 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 sort Nine, tournament sorting Ten, radix sort One, 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]) / / comparison and exchange of adjacent elements { Int temp; Temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } } } -------------------------------------------------Code------------------------------------------------ The efficiency O (N2) applies to sorting small lists. Two, select sorting ----------------------------------Code n the number of -------------------------------- ascending order Void, SelectSortArray () { Int min_index; For (int i=0; in-1; i++) { Min_index=i; For (int j=i+1; jn; j++) / / each scan choose the smallest item If (arr[j]arr[min_index]) min_index=j; If (min_index! =i) / / find the minimum exchange, this is a move to the correct position in the list { Int temp; Temp=arr[i]; arr[i]=arr[min_index]; arr[min_index]=temp; } } } -------------------------------------------------Code------------------------------