1#include <iostream>
2#include <vector>
3#include <algorithm>
4
5int main() {
6  // Create a vector of numbers
7  std::vector<int> numbers = {5, 2, 8, 1, 9};
8
9  // Sort the vector in ascending order
10  std::sort(numbers.begin(), numbers.end());
11
12  // Print the sorted vector
13  std::cout << "Sorted numbers: ";
14  for (int num : numbers) {
15    std::cout << num << " ";
16  }
17  std::cout << std::endl;
18
19  // Find the minimum and maximum numbers in the vector
20  int minNum = *std::min_element(numbers.begin(), numbers.end());
21  int maxNum = *std::max_element(numbers.begin(), numbers.end());
22
23  // Print the minimum and maximum numbers
24  std::cout << "Minimum number: " << minNum << std::endl;
25  std::cout << "Maximum number: " << maxNum << std::endl;
26
27  return 0;
28}```
29
30In this example, we start by creating a vector of numbers. Then, we use the `std::sort` function from the algorithms library to sort the vector in ascending order. We also use the `std::min_element` and `std::max_element` functions to find the minimum and maximum numbers in the vector.
31
32The output of the above code will be:

1As you can see, the algorithms library provides convenient functions for performing these common tasks. By utilizing these functions, you can write cleaner and more efficient code for working with containers in C++.
2
3Take some time to explore the algorithms library and its functions, and consider how you can apply them in your algo trading projects.