Second Permutation algorithm

[valonis]

Hi all,
I also have 3 other codes that I need a comment for them. I will post 2 others in other posts. Thanks

#include "stdafx.h"
#include <iostream>
#include <algorithm>
using namespace std;

int main () {
  int n;
  cout<<"N=";
  cin>>n;
 
  int myints[20]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
	
	
 

  cout << "The N! possible permutations with n elements:\n";

  sort (myints,myints+n);
  
  do {
	  for(int i=0;i<n;i++)
	  {
    cout << myints[i]<<" ";
	  }
	  cout<<endl;
  } while ( next_permutation (myints,myints+n) );

  return 0;
}