数数字! Ⅰ NSERTION-SORT(A) cost times I forj= 2 to A length 2 key= Aj 3∥ Insert A[] into the sorted sequence AI.j-1 5 while i>0 and Ai> key Ai+1=Ai i=i-1 84[1+1=ke数数字！