Java Selection Sort but make it read the data 64, 25, 12, 22, 11 from a file not an array   // Java program for implementation of Selection Sort class SelectionSort {     void sort(int arr[])     {         int n = arr.length;           // One by one move boundary of unsorted subarray         for (int i = 0; i < n-1; i++)         {             // Find the minimum element in unsorted array             int min_idx = i;             for (int j = i+1; j < n; j++)                 if (arr[j] < arr[min_idx])                     min_idx = j;               // Swap the found minimum element with the first             // element             int temp = arr[min_idx];             arr[min_idx] = arr[i];             arr[i] = temp;         }     }       // Prints the array     void printArray(int arr[])     {         int n = arr.length;         for (int i=0; i

Please run this code for n=6 for arrays 1,34,0,6,78,11 and n=5 for array 8,7,6,5,4 #include <stdio.h>void selection_sort(int arr[], int n) {    if (n<=1)    return ;    int max_id=0;    for(int i=0;i<n;i++) {        if(arr[i]>arr[max_id])        max_id=i;            }    int temp=arr[max_id];    arr[max_id]=arr[n-1];    arr[n-1]=temp;    selection_sort(arr,n-1);    return;}

JAVAsimulate the process of selection sort for array {3,1,2,4}

int [] list = {18,57,8,89,7} and the length = 5  Sort the array using insertion sort algorithm. Fill out the trace table  public class InsertionSort { /** The method for sorting the numbers */ public static void insertionSort(int[] list) { for (int i = 1; i < list.length; i++) { /** insert list[i] into a sorted sublist list[0..i-1] so that list[0..i] is sorted. */ int currentElement = list[i]; int k; for (k = i - 1; k >= 0 && list[k] > currentElement; k--) { list[k + 1] = list[k]; } // Insert the current element into list[k+1] list[k + 1] = currentElement; } } /** A test method */ public static void main(String[] args) { int[] list = {18,57,8,89,7}; insertionSort(list); for (int i = 0; i < list.length; i++) System.out.print(list[i] + " "); } }