Swd007-4 guruh talabasi: Avazov Javohirbek Ro’yxatdagi eng katta elementini aniqlang

SWD007-4 guruh talabasi: Avazov Javohirbek
3. Ro’yxatdagi eng katta elementini aniqlang.
#include
#include
#include
Using namespace std;
Int main() {
Srand(time(NULL));
Int n;
Cout << “Ro’yhatdagi elementlar soni: “; cin >> n;
List a;
List ::iterator max;
For (int j = 1; j <= n; j++) {
a.push_back(rand() % 10 – 5); }
max = a.begin();
for (auto i = a.begin(); i != a.end(); i++) {
cout << *i << “ “;
if (*max < *i)
*max = *i; }
Cout << “\nmax=” << *max;
_getwch();
Return 0; }

3 Navbat eng kichik elementi topilsin va undan keyin 0 joylashtirilsin.

#include
#include
#include
int main() {
std::vector nums {4, 7, 2, 9, 1, 8, 3, 6, 5};
auto min_num = std::min_element(nums.begin(), nums.end());
std::cout << "Navbat eng kichik element: " << *min_num << std::endl;
std::cout << 0 << std::endl;

return 0;

}