d3y1`5 81_09

Pseudo codeBUBBLESORT(A) 1 for i=1 to A.length-1 2 for j=A.length downto i+1 3 if A[j] < A[j-1] 4 exchange A[j] with A[j-1] Reference<< Introduction to Algorithms >> Thi

Pseudo codeINSERTION-SORT(A) 1 for j=2 to A.length 2 key = A[j] 3 //Insert A[j] into the sorted sequence A[1..j-1] 4 i = j-1 5 while i>0 and A[i]>key 6 A[i+1] = A[i] 7 i

Merge sort:归并排序Animation An example of merge sort. First divide the list into the smallest unit (1 element), then compare each element with the adjacent list to sort and merge the two adjacent lists.