c语言排序（C language sorting）.docVIP

c语言排序（C language sorting） This is the c++ insertion sorting source See for yourself!! # include iostream.h # include conio.h # define MAXSIZE 20 # define MAX_LENGTH 100 Typedef int RedType; Typedef struct {RedType r[MAXSIZE+1]; Int length; }SqList; Void InsertSort (SqList L) {int, I, j; For (i=2; I =L.length; ++i) If (L.r[i], L.r[i-1]) {L.r[0]=L.r[i]; For (j=i-1; L.r[0] L.r[j]; --j) L.r[j+1]=L.r[j]; L.r[j+1]=L.r[0]; } } Void, main () {int i; SqList L; Cout endl endl InsertSort.cpp; Cout endl ==============; Cout endl Please, input, the, length, of, SqList (eg, 5): endl endl; Cin L.length; For (i=1; I =L.length; ++i) {cout input the i th integer (eg, 58) Please:; Cin L.r[i]; } Cout endl The disordered:; For (i=1; I =L.length; i++) Cout L.r[i] ; InsertSort (L); Cout endl The ordered:; For (i=1; I =L.length; i++) Cout L.r[i] ; Cout endl endl ... OK!...; Getch (); I throw a brick of useful [0] [0] reference report recommended: senior management TOP essence, why a lot of people say that the true master is the master C rather than C++. Sylmoon (wolf alone) Grade： #6 building score: 15 reply: 2002-06-19 21:02:37, first look at the most basic array sorting - bubble sort. For example, we have an array of: 2, 57, 29, 89, 42, 34, 16, 1. By comparing bubbles, large sinks, small floats, the adjacent values are compared, Big back row. If the two adjacent values are in ascending order, they remain the same, if they are in descending order Exchange their values: Start: a[0]2, a[1]57, a[2]29, a[3]89, a[4]42, a[5]34, a[6]16, a[7]1 1, times:2, 29, 57, 42, 34,, 16, 1, 89 2, times:, 2, 29, 42, 34,, 16, 1, 57, 八十九 3次：2, 29, 34，16, 1, 42，57, 89 4次：2, 29, 16，1, 34, 42，57, 89 5次：2, 16, 1，29, 34, 42，57, 89 6次：2, 1, 16，29, 34, 42，57, 89 7次：1, 2, 16，29, 34, 42，57, 89 我们可以用两个循环来控制排序，一个控制趟数，一个控制每趟的排序。 控制趟数是1到7 控制每趟的比较次数也是1到7 推广一下：有N个项的数组，如果要实行冒泡排序，最多排N-1次，每次比较N-1次。 经过我们自己的思考+书上的提示，写下了冒泡排序的源程序： #包括 stdio. h #包括是。H #定义尺寸8 main() { a [尺寸] = { 2,57,29,89,42,34,16,1