Pancake sorting

3.cpp

//http://www.geeksforgeeks.org/pancake-sorting/

void flip(vector<int> v, int i){
  int temp, start = 0;
  while(start < i){
    int temp = v[start];
    v[start] = v[i];
    v[i] = temp;
    start++;
    i--;
  }
}

int findmax(vector<int>, int end){
  int maxindex = 0;
  int maxvalue = v[end];
  for(int i=0; i<end; i++){
    if(v[i] > maxvalue){
      maxi = i;
      maxvalue = v[i];
    }
  }
  return maxi;
}

void pancake(vector<int> v){
  for(int cur = n; cur >=0;  cur--){
    int maxindex = findmax(v, cur);
    filp(v,maxindex);
    flip(v,cur-1);
  }
}