fork download 
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4.  
  5. using namespace std;
  6.  
  7. int findMin(const vector<int>& v)
  8. {
  9.     int minValue = v[0];
  10.  
  11.     for (int i = 1; i < v.size(); i++)
  12.     {
  13.         if (v[i] < minValue)
  14.             minValue = v[i];
  15.     }
  16.  
  17.     return minValue;
  18. }
  19.  
  20. void reverseVector(vector<int>& v)
  21. {
  22.     reverse(v.begin(), v.end());
  23. }
  24.  
  25. void printVector(const vector<int>& v)
  26. {
  27.     for (int x : v)
  28.         cout << x << " ";
  29.  
  30.     cout << endl;
  31. }
  32.  
  33. int main()
  34. {
  35.     vector<int> numbers;
  36.  
  37.     int n;
  38.  
  39.     cout << "Enter number of elements: ";
  40.     cin >> n;
  41.  
  42.     cout << "Enter elements:" << endl;
  43.  
  44.     for (int i = 0; i < n; i++)
  45.     {
  46.         int x;
  47.         cin >> x;
  48.         numbers.push_back(x);
  49.     }
  50.  
  51.     cout << "\nVector elements (range-for): ";
  52.     printVector(numbers);
  53.  
  54.     cout << "Vector elements (index): ";
  55.  
  56.     for (int i = 0; i < numbers.size(); i++)
  57.         cout << numbers[i] << " ";
  58.  
  59.     cout << endl;
  60.  
  61.     if (!numbers.empty())
  62.     {
  63.         numbers.pop_back();
  64.  
  65.         cout << "\nAfter pop_back(): ";
  66.         printVector(numbers);
  67.     }
  68.  
  69.     if (!numbers.empty())
  70.     {
  71.         cout << "First element: "
  72.              << numbers.front() << endl;
  73.  
  74.         cout << "Last element: "
  75.              << numbers.back() << endl;
  76.     }
  77.  
  78.     sort(numbers.begin(), numbers.end());
  79.  
  80.     cout << "\nSorted vector: ";
  81.     printVector(numbers);
  82.  
  83.     cout << "Size = "
  84.          << numbers.size() << endl;
  85.  
  86.     int value;
  87.  
  88.     cout << "\nEnter value to search: ";
  89.     cin >> value;
  90.  
  91.     auto it = find(numbers.begin(),
  92.                    numbers.end(),
  93.                    value);
  94.  
  95.     if (it != numbers.end())
  96.         cout << "Element found." << endl;
  97.     else
  98.         cout << "Element not found." << endl;
  99.  
  100.     cout << "\n===== TASK 2 =====" << endl;
  101.  
  102.     cout << "Minimum element = "
  103.          << findMin(numbers)
  104.          << endl;
  105.  
  106.     reverseVector(numbers);
  107.  
  108.     cout << "Reversed vector: ";
  109.     printVector(numbers);
  110.  
  111.     numbers.clear();
  112.  
  113.     cout << "\nVector cleared." << endl;
  114.  
  115.     cout << "Size after clear = "
  116.          << numbers.size()
  117.          << endl;
  118.  
  119.     return 0;
  120. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin 
9 1 7 5 3
9
stdout 
Enter number of elements: Enter elements:

Vector elements (range-for): 1 7 5 3 9 9 9 9 9 
Vector elements (index): 1 7 5 3 9 9 9 9 9 

After pop_back(): 1 7 5 3 9 9 9 9 
First element: 1
Last element: 9

Sorted vector: 1 3 5 7 9 9 9 9 
Size = 8

Enter value to search: Element found.

===== TASK 2 =====
Minimum element = 1
Reversed vector: 9 9 9 9 7 5 3 1 

Vector cleared.
Size after clear = 0
https://ideone.com/u6BXTq
language:
C++14 (gcc 8.3)
created:
10 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!