arr[] = {10, 20, 5, 23, 42, 15};
14 intn =
sizeof(arr) /
sizeof(arr[0]);
15std::vector<int> vect(arr, arr + n);
17std::cout <<
"Vector is: ";
18 for(
inti = 0; i < n; i++) std::cout << vect[i] <<
" ";
21std::sort(vect.begin(), vect.end());
23std::cout <<
"\nVector after sorting is: ";
24 for(
inti = 0; i < n; i++) std::cout << vect[i] <<
" ";
27std::reverse(vect.begin(), vect.end());
29std::cout <<
"\nVector after reversing is: ";
30 for(
inti = 0; i < 6; i++) std::cout << vect[i] <<
" ";
32std::cout <<
"\nMaximum element of vector is: ";
33std::cout << *max_element(vect.begin(), vect.end());
35std::cout <<
"\nMinimum element of vector is: ";
36std::cout << *min_element(vect.begin(), vect.end());
39std::cout <<
"\nThe summation of vector elements is: ";
40std::cout << accumulate(vect.begin(), vect.end(), 0);
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