In given integer list that support three functions findMin, findMax, findMedian. Sort the array.

public static void permutation(int [] arr, int i, int length) { if (length = i) { printArray(arr, length); return; } int j = i; for (j = i; j < length; j++) { swap (arr, i, j); permutation (arr, i + 1, length); swap (arr, i, j); } return; } public static void Main(string[] args) { int[] arr = new int[5]; for (int i = 0; i < 5; i++) { arr[i] = i; } permutation (arr, 0, 5);