Question
Implement the Insertion Sort algorithm as discussed in Lecture 1. (Hint: use the function checked_sorted to check if your output is indeed sorted) (I tried
Implement the Insertion Sort algorithm as discussed in Lecture 1. (Hint: use the function checked_sorted to check if your output is indeed sorted)
(I tried to solve it, it runs but it is take a while to end the run)
package sorting;
import java.util.*;
public class Sort {
public static int[] insertion_sort (int[] array) {
/*
* fill in your program
*/
return array;
}
/*
* n: the size of the output array
* k: the maximum value in the array
*/
public static int[] generate_random_array (int n, int k) {
List
int[] array;
Random rnd;
rnd = new Random(System.currentTimeMillis());
list = new ArrayList
for (int i = 1; i <= n; i++)
list.add(new Integer(rnd.nextInt(k+1)));
Collections.shuffle(list, rnd);
array = new int[n];
for (int i = 0; i < n; i++)
array[i] = list.get(i).intValue();
return array;
}
/*
* n: the size of the output array
*/
public static int[] generate_random_array (int n) {
List
int[] array;
list = new ArrayList
for (int i = 1; i <= n; i++)
list.add(new Integer(i));
Collections.shuffle(list, new
Random(System.currentTimeMillis()));
array = new int[n];
for (int i = 0; i < n; i++)
array[i] = list.get(i).intValue();
return array;
}
/*
* Input: an integer array
* Output: true if the array is acsendingly sorted, otherwise return
false
*/
public static boolean check_sorted (int[] array) {
for (int i = 1; i < array.length; i++) {
if (array[i-1] > array[i])
return false;
}
return true;
}
public static void print_array (int[] array) {
for (int i = 0; i < array.length; i++)
System.out.print(array[i] + ", ");
System.out.println();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("Insertion sort starts ------------------");
for (int n = 100000; n <= 1000000; n=n+100000) {
int[] array = Sort.generate_random_array(n);
long t1 = System.currentTimeMillis();
array = Sort.insertion_sort(array);
long t2 = System.currentTimeMillis();
long t = t2 - t1;
boolean flag = Sort.check_sorted(array);
System.out.println(n + "," + t + "," + flag);
}
System.out.println("Insertion sort ends ------------------");
}
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started