CODEWITHSUNDEEP
c++algorithm
Faken
Faken

Reputation: 11822

Finding the position of the maximum element

Is there a standard function that returns the position (not value) of the maximum element of an array of values?

For example:

Suppose I have an array like this:

sampleArray = [1, 5, 2, 9, 4, 6, 3]

I want a function that returns the integer of 3 that tells me that sampleArray[3] is the largest value in the array.

Upvotes: 104

Views: 191606

Answers (6)

rashedcs
rashedcs

Reputation: 3725

You can use the max_element() function to find the position of the maximum element.

int main()
{
    int num, arr[10];        

    cin >> num;

    for (int i = 0; i < num; i++)
    {
        cin >> arr[i];
    }

    cout << "Max element Index: " << max_element(arr, arr + num) - arr;

    return 0;
}

Upvotes: 9

Gaurav
Gaurav

Reputation: 19

cout<<max_element(arr.begin(), arr.end()) - arr.begin();

Upvotes: 0

Alex
Alex

Reputation: 627

Or, written in one line:

std::cout << std::distance(sampleArray.begin(),std::max_element(sampleArray.begin(), sampleArray.end()));

Upvotes: 46

Stephen
Stephen

Reputation: 49234

In the STL, std::max_element provides the iterator (which can be used to get index with std::distance, if you really want it).

int main(int argc, char** argv) {
  int A[4] = {0, 2, 3, 1};
  const int N = sizeof(A) / sizeof(int);

  cout << "Index of max element: "
       << distance(A, max_element(A, A + N))
       << endl;

  return 0;
}

Upvotes: 166

Uri
Uri

Reputation: 89839

STL has a max_elements function. Here is an example: http://www.cplusplus.com/reference/algorithm/max_element/

Upvotes: 0

avakar
avakar

Reputation: 32685

std::max_element takes two iterators delimiting a sequence and returns an iterator pointing to the maximal element in that sequence. You can additionally pass a predicate to the function that defines the ordering of elements.

Upvotes: 1

Related Questions