Traversing arrays problem

[SuperKoko]

#include <algorithm> // for min_element/max_element
#include <iostream> // for cout
using namespace std;
int main()
{
cout <<"witness the awesome power of the LARGEST VALUE IN ARRAY FINDER !!!\n\n";

int array[] = {5,6,3,230,3,4,6,110};
unsigned const num_elements=sizeof(array)/sizeof(int);
int * plargest = max_element(array,array+num_elements);

cout <<"It's position in the array is "<< (plargest-array) <<"\n";
cout <<"Largest value in array: "<< *plargest;
cin.get();
cin.get();
return 0;
}

max_element yields a pointer/iterator to the largest element, not a pointer to a position of the largest element.
To get position, you simply need to compute the difference pointer_to_largest-array