#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
vector<int> vec = { 4, 5, 2, 1, 7, 3, 6, 0 };
auto minindex = min_element(vec.cbegin(), vec.cend());
cout << "min: " << *minindex << endl;
auto maxindex = max_element(vec.cbegin(), vec.cend());
cout << "max: " << *maxindex << endl;
// find the first element with value 1
auto indexval1 = find(vec.begin(), vec.end(), 1);
if (vec.end() == indexval1)
std::cout << "not found" << std::endl;
else
std::cout << "found" << std::endl;
for (auto elem : vec) {
cout << elem << ' ';
}
std::cout << std::endl;
sort(vec.begin(), vec.end());
for (auto elem : vec) {
cout << elem << ' ';
}
std::cout << std::endl;
reverse(vec.begin(), vec.end());
for (auto elem : vec) {
cout << elem << ' ';
}
std::cout << std::endl;
return 0;
}
/*
run:
min: 0
max: 7
found
4 5 2 1 7 3 6 0
0 1 2 3 4 5 6 7
7 6 5 4 3 2 1 0
*/
