Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

40,026 questions

51,982 answers

573 users

How to find max and min of a subset of an array in C++

1 Answer

0 votes
#include <algorithm>
#include <iostream>
#include <vector>

int main() {
    std::vector<int> arr = { 1, 3, 7, 9, 2, 8, 5, 4 };

    std::vector<int> subArray(arr.begin() + 1, arr.begin() + 5);
    
    int max = *std::max_element(subArray.begin(), subArray.end());
    std::cout << max << std::endl;

    int min = *std::min_element(subArray.begin(), subArray.end());
    std::cout << min << std::endl;
}

  
  
/*
run:
  
9
2
  
*/

 



answered Jul 20, 2024 by avibootz

Related questions

1 answer 86 views
1 answer 110 views
2 answers 134 views
1 answer 102 views
1 answer 113 views
1 answer 97 views
...