#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void test0()
{
vector<int> value_vector;
for(int i = 0; i < 100; i++)
{
value_vector.push_back(rand() % 500);
}
void Print_Space(vector<int> &value_vector);
void Print_sort_max_min(vector<int> &value_vector);
Print_sort_max_min(value_vector);
}
void Print_Space(vector<int> &value_vector)
{
cout << "容器是否为空: " << (value_vector.empty() == true?"是空":"非空") << endl;
}
void Print_sort_max_min(vector<int> &value_vector)
{
sort(value_vector.begin(),value_vector.end());
for(unsigned int i = 0; i < value_vector.size();i++)
{
//cout << value_vector[i] << ",";
cout << value_vector.at(i) << ",";
}
cout << endl;
cout <<"最大值:" << value_vector.back() << endl;
cout <<"最小值:" << value_vector.front() << endl;
}
int main()
{
test0();
return 0;
}