摘要：
1. 步骤：(CountSort) 1) 求得min, max 2) 开辟空间 a[0, max-min] = ｛-1｝ 3) if min < 0: data[i] += |min| else: data[i] –= min 4) for i = 0 to n: a[data[i]] = 1 5) index = 0 for i = 0 to max-min: if a[i] = 1... 阅读全文
posted @ 2011-10-23 23:54
Let it be!
阅读(252)评论(0)推荐(0)
编辑