冒泡排序算法（Bubble sort algorithm）.doc

冒泡排序算法（Bubble sort algorithm） Collected by oneself Mistakes are unavoidable For reference only In case of error Please correct me! Thank you Bubble sort algorithm Before explaining the bubble sort algorithm Lets first introduce an algorithm that puts the largest number of 10 numbers (placed in an array A) in the last position The algorithm is described below: (1) from array A[1] to A[10] The two adjacent numbers are compared That is, A[1] and A[2] compare After comparison, A[2] compares with A[3] ... finally, A[9] and A[10] compare (2) in the course of each comparison If the previous number is larger than the latter one Then you change two numbers That is, move the larger number to the back Smaller to the front For example, in the first comparison If A[1] is larger than A[2], the values of A[1] and A[2] are interchanged The following figure uses 6 data to illustrate the above algorithms Suppose the 6 data is: A[]=5 74386 A[1], A[2], A[3], A[4], A[5], A[6] 574386 first time Comparison of A[1]=5 and A[2]=7 75 No swap 574386, second times Comparison of A[2]=7 and A[3]=4 47 Swap Then, after the second comparison, the data is 547386 547386, third times Comparison of A[3]=7 and A[4]=3 37 Swap Then, after the third comparison, the data is 543786 543786, Fourth Times Comparison of A[4]=7 and A[5]=8 87, no swap 543786, fifth times Comparison of A[6]=6 and A[5]=8 68 Swap Then the fifth and last result is... 543768 As can be seen from the above example For 6 numbers A row (maximum number) requires 5 Comparisons It can be deduced that... For the number of N One trip requires N-1 times to compare operations The above algorithm has put the largest number of N numbers into the A[N] Repeat the above algorithm Put the maximum number of A[1] to A[N-1] in A[N-1] In this way, second large numbers are stored in A[N-1] Next, put the maximum number of A[1] to A[N-2] in A[N-2] ... finally, put the big A[1] to A[2] in the A[2] After each repetition, 22 after comparison Compare the range and