Pancake sorting doubt

#1

If I use *max_element(v1.begin(), v1.end()); for finding maximum in a vector. What will be time complexity O(n) or O(1)…??

#2

hello @nidhigupta847
it will be O(N)