Finding minimum element in array using STL in C++

Question

Why the output is coming to be 50 it should have been 20.

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
  int v[] = {10, 20, 30, 50, 20, 70, 30};

  int* i1;
  i1 = std::min_element(v + 3, v + 4);

  cout << *i1 << "\n";
  return 0;
}

lubgr · Accepted Answer · 2019-10-09 08:58:12Z

15

STL algorithms operate on half-open ranges, which are usually denoted as [first, last). This means the first element is included in the range, the last element is not included. Hence

[v + 3, v + 4)

specifies a range of length 1, and the only element in that range has the value 50.The result of *std::min_element(v + 3, v + 4) can be nothing but 50.

edited Oct 9, 2019 at 8:58

answered Oct 9, 2019 at 8:30

lubgr

38.6k3 gold badges71 silver badges119 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Remy Lebeau Over a year ago

If you want to search the whole array, use std::min_element(v, v + 7) instead, or better std::min_element(std::begin(v), std::end(v))

Collectives™ on Stack Overflow

Finding minimum element in array using STL in C++

1 Answer 1

1 Comment

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Related