Algorithm C++

  1. Home
  2. C++
  3. Algorithm
  4. Use generic adjacent_find algorithm with a predicate to find the first name that is lexicographically greater than the next one.
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
int main()
{
  deque player(5);
  deque::iterator i;
  player[0] = "PPPP";
  player[1] = "AAAAAA";
  player[2] = "AAAAAA";
  player[3] = "NNNNNNNN";
  player[4] = "RRRRRRRRR";
  
  i = adjacent_find(player.begin(), player.end(), greater());
  cout << *i << endl;
  return 0;
}
/* 
PPPP
 */