坚持到底就是胜利

array algorithm

1. insert a value into sorted array
2. select nth element
3. delete duplicate element
4. find there exits two same items in a array
5. find duplicate element a[0.N-1]. range from 1--N-1
6. a+b = s
7. find prim
8. occurs odd
9. findMidArray

posted on 2006-11-21 22:11 ailab 阅读(192) 评论(0)  编辑 收藏 引用