11 {
12
13 int arr[] = {10, 20, 5, 23, 42, 15};
14 int n = sizeof(arr) / sizeof(arr[0]);
15 std::vector<int> vect(arr, arr + n);
16
17 std::cout << "Vector is: ";
18 for (int i = 0; i < n; i++) std::cout << vect[i] << " ";
19
20
21 std::sort(vect.begin(), vect.end());
22
23 std::cout << "\nVector after sorting is: ";
24 for (int i = 0; i < n; i++) std::cout << vect[i] << " ";
25
26
27 std::reverse(vect.begin(), vect.end());
28
29 std::cout << "\nVector after reversing is: ";
30 for (int i = 0; i < 6; i++) std::cout << vect[i] << " ";
31
32 std::cout << "\nMaximum element of vector is: ";
33 std::cout << *max_element(vect.begin(), vect.end());
34
35 std::cout << "\nMinimum element of vector is: ";
36 std::cout << *min_element(vect.begin(), vect.end());
37
38
39 std::cout << "\nThe summation of vector elements is: ";
40 std::cout << accumulate(vect.begin(), vect.end(), 0);
41
42 return 0;
43}
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4