Step By Step(Java 集合篇) (三)

1 #include

2 #include

3 #include

4 using namespace std;

5 int main()

6 {

7 vector v1;

8 for (int i = 0; i < 10; ++i)

9 v1.push_back(i);

10 set s1;

11 for (int i = 0; i < 20; ++i)

12 s1.insert(i);

13 sort(v1.begin(),v1.end());

14 binary_search(v1.begin(),v1.end(),5);

15 binary_search(s1.begin(),s1.end(),5);

16 return 0;

17 }

在Java中同样提供了这样的泛型算法，不同的是这些算法函数都是Collections中静态方法。见如下Java代码：

1 public static void main(String[] args) {

2 List v1 = new ArrayList();

3 for (int i = 0; i < 10; ++i)

4 v1.add(i);

5

6 List l1 = new LinkedList();

7 for (int i = 0; i < 20; ++i)

8 l1.add(i);

9

10 Collections.sort(v1);

11 Collections.sort(l1);

12 Collections.binarySearch(v1, 5);

13 Collections.binarySearch(l1, 5);

14 }