#include <iostream>
#include <vector>

using namespace std;

bool compLSD (int v1, int v2)
{
 return (v1%10 < v2%10);
}

int main()
{
 // v1 uses default and automatic allocation of space
 cout << "Uses default constructor and push_back()" << endl;
 vector<int> v1;

 v1.push_back(43);
 v1.push_back(53);
 v1.push_back(21);
 v1.push_back(97);
 v1.push_back(56);
 v1.push_back(83);
 v1.push_back(68);
 v1.push_back(38);
 v1.push_back(49);
 v1.push_back(10);
 v1.push_back(64);

 for (int i = 0; i < v1.size(); i++)
    {
     cout << v1[i] << ", ";
    }
 cout << endl;

 // print out values in vector using an iterator
 vector<int>::iterator iter1;
 int count=0;
 for (iter1 = v1.begin(); iter1 != v1.end(); ++iter1)
     {
      if (count%10 == 0)
         cout << endl << "v1[" << count << "]: ";
      count++;
      cout.width(5);
      cout << *iter1;
     }
 cout << endl << endl;

 sort (v1.begin(), v1.end());
 for (int i = 0; i < v1.size(); i++)
    {
     cout << v1[i] << ", ";
    }
 cout << endl;

 v1.push_back(28);
 v1.push_back(29);
 v1.push_back(20);
 v1.push_back(24);

 for (int i = 0; i < v1.size(); i++)
    {
     cout << v1[i] << ", ";
    }
 cout << endl;

 sort (v1.begin(), v1.end(), less<int>() );

 for (int i = 0; i < v1.size(); i++)
    {
     cout << v1[i] << ", ";
    }
 cout << endl;

 sort (v1.begin(), v1.end(), greater<int>() );

 for (int i = 0; i < v1.size(); i++)
    {
     cout << v1[i] << ", ";
    }
 cout << endl;

 sort (v1.begin(), v1.end(), compLSD );

 for (int i = 0; i < v1.size(); i++)
    {
     cout << v1[i] << ", ";
    }
 cout << endl;

}