插入排序伪代码:
INSERTION-SORT(A)
for j=2 to j=A.length
key=A[j]
i=j-1
while i>0 and A[i]>key
A[i+1]=A[i]
i=i-1
A[i+1]=key
插入排序的最坏运行情况 θ(n^2)
插入排序伪代码:
INSERTION-SORT(A)
for j=2 to j=A.length
key=A[j]
i=j-1
while i>0 and A[i]>key
A[i+1]=A[i]
i=i-1
A[i+1]=key
插入排序的最坏运行情况 θ(n^2)