Solution permutation with sorting

Solution permutation with sorting.cpp

bool order(int x, int y) {
  int xr = x ^ y, lowest_diff_bit = xr&(-xr);
  return (x & lowest_diff_bit);
}

void print_sequence(int N) {
  int* A = new int[N];
  for (int i = 0; i < N; ++i)
    A[i] = i+1;
  	
  sort(A, A + N, order);
  for (int i = 0; i < N; ++i)
    printf("%d ", A[i]);
  printf("\n");
  
  delete[] A;
}