You are viewing a single comment's thread. Return to all comments →
I used selection sort. getting terminated due to timeout for testcases 8 to 13.
int minimumSwaps(int arr_count, int* arr) { int count = 0,i,j,position,swap;
for (i = 0;i<(arr_count - 1);i++) { position = i;
for (i = 0;i<(arr_count - 1);i++)
{ position = i;
for (j=i + 1;j<arr_count;j++) { if (arr[position]>arr[j]) position = j; } if (position != i) { swap = arr[i]; arr[i] = arr[position]; arr[position] = swap; count++; }
} return count; }
Minimum Swaps 2
You are viewing a single comment's thread. Return to all comments →
I used selection sort. getting terminated due to timeout for testcases 8 to 13.
int minimumSwaps(int arr_count, int* arr) { int count = 0,i,j,position,swap;
} return count; }