#include <bits/stdc++.h> #include "sorting.h" using namespace std; int findSwapPairs(int N, int a[], int M, int X[], int Y[], int P[], int Q[]) { for(int i = 0;i<N;i++){ int mn = a[i], id = i; for(int j = i + 1;j<N;j++){ if(a[j] < mn){ mn = a[j]; id = j; } } P[i] = i, Q[i] = id; } return N; }