-
-
Notifications
You must be signed in to change notification settings - Fork 7.3k
/
vector_important_functions.cpp
43 lines (33 loc) · 1.25 KB
/
vector_important_functions.cpp
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
/**
* @file
* @brief A C++ program to demonstrate working of std::sort(), std::reverse()
*/
#include <algorithm>
#include <iostream>
#include <numeric> // For accumulate operation
#include <vector>
/** Main function */
int main() {
// Initializing vector with array values
int arr[] = {10, 20, 5, 23, 42, 15};
int n = sizeof(arr) / sizeof(arr[0]);
std::vector<int> vect(arr, arr + n);
std::cout << "Vector is: ";
for (int i = 0; i < n; i++) std::cout << vect[i] << " ";
// Sorting the Vector in Ascending order
std::sort(vect.begin(), vect.end());
std::cout << "\nVector after sorting is: ";
for (int i = 0; i < n; i++) std::cout << vect[i] << " ";
// Reversing the Vector
std::reverse(vect.begin(), vect.end());
std::cout << "\nVector after reversing is: ";
for (int i = 0; i < 6; i++) std::cout << vect[i] << " ";
std::cout << "\nMaximum element of vector is: ";
std::cout << *max_element(vect.begin(), vect.end());
std::cout << "\nMinimum element of vector is: ";
std::cout << *min_element(vect.begin(), vect.end());
// Starting the summation from 0
std::cout << "\nThe summation of vector elements is: ";
std::cout << accumulate(vect.begin(), vect.end(), 0);
return 0;
}