#include <iostream>
#include <vector>
#include <algorithm>
int main() {
std::vector<int> myVector = {5, 2, 8, 1, 3};
// Step 1: Output the original vector
std::cout << "Original Vector: ";
for (int num : myVector) {
std::cout << num << " ";
}
std::cout << "\n";
// Step 2: Sort the vector in ascending order using std::sort
std::sort(myVector.begin(), myVector.end());
// Step 3: Output the sorted vector
std::cout << "Sorted Vector (Ascending): ";
for (int num : myVector) {
std::cout << num << " ";
}
std::cout << "\n";
// Step 4: Sort the vector in descending order using a lambda function
std::sort(myVector.begin(), myVector.end(), [](int a, int b) {
return a > b;
});
// Step 5: Output the sorted vector in descending order
std::cout << "Sorted Vector (Descending): ";
for (int num : myVector) {
std::cout << num << " ";
}
std::cout << "\n";
return 0;
}