![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Introduction to Algorithms
hebzai2005
这个作者很懒,什么都没留下…
展开
-
2.1-2
//Rewrite the INSERTION-SORT procedure to sort into nonincreasing instead of non- decreasing order. for j = 2 to A.length key = A[j] i = j - 1 while i >0 and A[i] < key A[i +1] = A[i]原创 2012-08-17 03:36:36 · 217 阅读 · 0 评论 -
2.1-3
for i = 1 to A.length if (v == A[i]) return i return NIL原创 2012-08-17 03:59:53 · 233 阅读 · 0 评论