-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSort_Vector.cpp
More file actions
44 lines (39 loc) · 924 Bytes
/
Sort_Vector.cpp
File metadata and controls
44 lines (39 loc) · 924 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
bool User_Def(int item1, int item2);
int main()
{
vector<int> v = {9, 5, 6, 2, 7, 1};
cout << "Before sorting: ";
for_each(v.begin(), v.end(), [](int x) {
cout << x << " ";
});
sort(v.begin(), v.end());
cout << endl << "After sorting: ";
for (int i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
sort(v.begin(), v.end(), greater<int>());
cout << endl << "After re-sorting: ";
for (int i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
sort(v.begin(), v.end(), User_Def);
cout << endl << "After re-sorting by user defined: ";
for (int i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
cout << endl;
system("pause");
return 0;
}
bool User_Def(int item1, int item2)
{
return item1 > item2;
}