Choose Correct C Code For Recursive Selection Sort From The #1769

 #include <iostream> using namespace std; int minIndex(int a[], int i, int j) { if (i == 0) return i; int k = minIndex(a, i + 1, j); return (a[i] < a[k])? i : k; } void recursiveSelectionSort(int a[], int n, int index = 0) {  if (index == n) return; int x = minIndex(a, index, n-1); if (x == index) { swap(a[x], a[index]); } recursiveSelectionSort(a, n, index + 1); } int main() { int arr[] = {5,3,2,4,1}; int n = sizeof(arr)/sizeof(arr[0]); recursiveSelectionSort(arr, n); return 0; } 

 #include <iostream> using namespace std; int minIndex(int a[], int i, int j) { if (i == j) return i; int k = minIndex(a, i + 1, j); return (a[i] > a[k])? i : k; } void recursiveSelectionSort(int a[], int n, int index = 0) { if (index == n) return; int x = minIndex(a, index, n-1); if (x != index) { swap(a[x], a[index]); } recursiveSelectionSort(a, n, index + 1); } int main() { int arr[] = {5,3,2,4,1}; int n = sizeof(arr)/sizeof(arr[0]); recursiveSelectionSort(arr, n); return 0; } 

 #include <iostream> using namespace std; int minIndex(int a[], int i, int j) { if (i == j) return i; int k = minIndex(a, i + 1, j); return (a[i] > a[k])? i : k; } void recursiveSelectionSort(int a[], int n, int index = 0) { if (index == 0) return; int x = minIndex(a, index, n-1); if (x == index) { swap(a[x], a[index]); } recursiveSelectionSort(a, n, index + 1); } int main() { int arr[] = {5,3,2,4,1}; int n = sizeof(arr)/sizeof(arr[0]); recursiveSelectionSort(arr, n); return 0; }