- 博客(1)
- 资源 (1)
- 收藏
- 关注
转载 算法分析
Insertion sort...A[1,2,...,n]for j i key while i > 0 and key > A[i]A[i+1] i A[i+1] Running time:Depends on input(e.g. already sorted)Depends on input sizeparameterize things in the input, time = f(input), so the time is a function of inputWe want the time
2010-11-25 15:13:00 672
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人