Write a program that benchmarks QuickSort and InsertionSort. You should use at least 5 different data sets and record the performance of each algorithm on the same sets under the same conditions. Write a short report that compares the two algorithms based your results. It is important to include a discussion of the initial states of the data sets in your report. language Java public class week3 {public static void main(String args[]){ //=============
Write a program that benchmarks QuickSort and InsertionSort. You should use at least 5 different data sets and record the performance of each
language Java
public class week3 {public static void main(String args[]){ //========================================================== //Question 1 testing //================== // Comment on benchmarking for Q1 results // // //========================================================== } static void quickSort(int f[], int p, int q){ if(q-p <= 1) ; //skip else{ int x; int i, j, k; // let x = middle element in f[p..q-1] x = f[(p+q)/2]; //x = f[p]; i = p; j = p; k = q; while(j != k){ if(f[j] == x) j = j + 1; else if(f[j] < x){ //swap f[j] with f[i] int temp; temp = f[j]; f[j] = f[i]; f[i] = temp; j = j + 1; i = i + 1; } else{ // f[j] > x // swap f[j] with f[k-1] int temp; temp = f[j]; f[j] = f[k-1]; f[k-1] = temp; k = k - 1; } } quickSort(f,p,i); quickSort(f,j,q); } }
static void insertionSort(int k[], int a, int b) { int j = a+1; while (j < b) { int i = j; while (i > a && k[i] < k[i-1]) {//swap k[i], k[i-1] int temp = k[i]; k[i] = k[i-1]; k[i-1] = temp; i = i-1; } j = j+1; } }
}
Step by step
Solved in 2 steps with 2 images
