Instructions

CREATE THE DRIVER TO TEST NEXT PROGRAM AND READ THE data1.data,data2.data until data7.data

PROGRAM PROVIDED

import java.util.*; import java.io.*;

public class Sorting{

public static void insertionSort1(int[] arr){ for(int i=1; i=0 ; k--){ if(arr[k+1]=index+1 ; k--){ arr[k]=arr[k-1]; } arr[index]=hold; } }

public static void selectionSort(int[] arr){ for(int i=0; iarr[maxIndex]) maxIndex=k; } //swap int tmp=arr[maxIndex]; arr[maxIndex]=arr[arr.length-i-1]; arr[arr.length-i-1]=tmp; } }

public static void bubbleSort(int[] arr){ for(int i=0; iarr[k+1]){ //swap int hold=arr[k+1]; arr[k+1]=arr[k]; arr[k]=hold; } } } } public static int binarySearch(int[] arr, int end, int val){ int min=0, max=end; while(min!=max){ int mid=(min+max)/2; if(arr[mid]>val){ max=mid; }else{ min=mid+1; } } return min; } public static void mergeSort(int[] arr){ mergeSortRec(arr, 0, arr.length-1); } private static void mergeSortRec(int[] arr, int first, int last){ if(first

Write a program named SortingAlgorithm.java and implement the following sorting algorithm as we discussed in class: public static void bubbleSort(int[] arr) public static void selection Sort(int[] arr) public static void insertion Sort(int[] arr) public static void mergeSort(int[] arr) public static void quickSort(int[] arr) Download all data files and use each of these sorting algorithms to sort the data. Record the sorting time of each algorithm and tabulate results as follows: bubble selection insertion merge quick data1(m) 1 2 2 89956 589456 859 data2(n) 10 9 (m) for millisecond (n) for nano time To test all data files, you need to download your program and all data files, then test your sorting algorithm in local computer. The first line in the data file represents two numbers and M, followed by N line and each line contains M integers. Use those numbers to create an array and use each of the sorting method to test the time spend to sort the numbers. Write a program named SortingAlgorithm.java and implement the following sorting algorithm as we discussed in class: public static void bubbleSort(int[] arr) public static void selection Sort(int[] arr) public static void insertion Sort(int[] arr) public static void mergeSort(int[] arr) public static void quickSort(int[] arr) Download all data files and use each of these sorting algorithms to sort the data. Record the sorting time of each algorithm and tabulate results as follows: bubble selection insertion merge quick data1(m) 1 2 2 89956 589456 859 data2(n) 10 9 (m) for millisecond (n) for nano time To test all data files, you need to download your program and all data files, then test your sorting algorithm in local computer. The first line in the data file represents two numbers and M, followed by N line and each line contains M integers. Use those numbers to create an array and use each of the sorting method to test the time spend to sort the numbers